scientific article; zbMATH DE number 3913670

MaRDI QIDQ3690212zbMATH OpenFDO

Authors Volker Strassen

Publication date 1984

zbMATH Keywords

algebraic complexitybibliographybilinear formsdiscrete Fourier Transformlower boundmatrix multiplicationNP-completenesssurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 727424
• scientific article; zbMATH DE number 3972183
• scientific article; zbMATH DE number 976329
• scientific article; zbMATH DE number 4112009
• Algebraic complexity theory. I: An introduction

Cited in

(13)

• The parallel complexity of function approximation
• The multiplicative complexity of quadratic boolean forms
• Test complexity of generic polynomials
• Algebraic complexity theory. I: An introduction
• Maximal bilinear complexity and codes
• scientific article; zbMATH DE number 3972183 (Why is no real title available?)
• scientific article; zbMATH DE number 4112009 (Why is no real title available?)
• scientific article; zbMATH DE number 727424 (Why is no real title available?)
• scientific article; zbMATH DE number 3002458 (Why is no real title available?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On genuinely time bounded computations
• Constructive universal algebra: An introduction
• Zur genäherten Auflösung algebraischer Gleichungen

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690212)