Amanote Research

Amanote Research

  • Register
  • Sign In

Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-662-44602-7_11

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 2014

Authors

Jiří Wiedermann

Publisher

Springer Berlin Heidelberg


Related search

Fast Sparse Matrix Multiplication

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

An Efficient Parallel Algorithm for Matrix-Vector Multiplication

1993English

A Nondeterministic Minimization Algorithm

1990English

Enhanced Matrix Chain Multiplication

Journal of Cyber Security and Mobility
HardwareComputer NetworksArchitectureCommunications
2018English

Practical Fast Polynomial Multiplication

1976English

On Sunflowers and Matrix Multiplication

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2013English

Fast Frequency Acquisition via Adaptive Least-Squares Algorithm

IEE Proceedings F Radar and Signal Processing
1989English

Strassen's Matrix Multiplication on GPUs

2011English

The Implementation of Chirp Scaling Algorithm via Fast Fourier Transform

International Journal of Research Studies in Computer Science and Engineering
2019English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy