scientific article
From MaRDI portal
Publication:3690212
zbMath0572.68026MaRDI QIDQ3690212
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveybibliographybilinear formsNP-completenesslower boundalgebraic complexitymatrix multiplicationdiscrete Fourier Transform
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (7)
Maximal bilinear complexity and codes ⋮ On genuinely time bounded computations ⋮ The parallel complexity of function approximation ⋮ The multiplicative complexity of quadratic boolean forms ⋮ Test complexity of generic polynomials ⋮ Constructive universal algebra: An introduction ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication:
