An elementary proof for Strassen's degree bound

DOI10.1016/0304-3975(76)90028-1zbMath0363.65012OpenAlexW1964093091MaRDI QIDQ1240517

Arnold Schönhage

Publication date: 1977

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90028-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation of special functions and constants, construction of tables (65D20)

Related Items (1)

Semi-algebraic decision complexity, the real spectrum, and degree

Cites Work

• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Unnamed Item
• Unnamed Item

This page was built for publication: An elementary proof for Strassen's degree bound