An elementary proof for strassen's degree bound

Arnold Schönhage

Type: Article

Publication Date: 1976-11-01

Citations: 10

DOI: https://doi.org/10.1016/0304-3975(76)90028-1

View Publication

Locations

Theoretical Computer Science - View

Similar Works

Action	Title	Year	Authors
+	A simple proof of Strassen's result	1978	G. Yuval
+	An elementary proof of Strauss conjecture	2014	N. Lai Yi Zhou
+ PDF Chat	Tight Size-Degree Bounds for Sums-of-Squares Proofs	2017	Massimo Lauria Jakob Nordström
+	Proof of Kuhn's polynomial conjectures	1985	G. K. Kristiansen
+ PDF Chat	A survey of degree-boundedness	2024	Xiying Du Rose McCarty
+	Properties of the Brouwer Degree	2014	Robert F. Brown
+	The Conway polynomial	2023	A. Sossinsky
+ PDF Chat	A polynomial version of Cereceda's conjecture	2019	Nicolás Bousquet Marc Heinrich
+	A Proof of Cramer's Conjecture Using Elementary Methods	2010	Roupam Ghosh
+	A combinatorial proof of a Chevyshev polynomial identity	1981	Louis W. Shapiro
+	A combinatorial proof of a Chevyshev polynomial identity	1981	Louis W. Shapiro
+ PDF Chat	Sendov’s conjecture for sufficiently-high-degree polynomials	2022	Terence Tao
+	A Proof of Sendovs conjecture for Polynomials of degree Ten	2019	Dinesh Sharma Bhattarai
+	An Elementary Proof of Grothendieck’s Theorem	2016	Edgar E. Enochs Sergio Estrada Blas Torrecillas
+	The existence of minimal honest polynomial degree below and recursively enumerable degrees	1988	Yang Dongping
+	Schinzel's Conjecture and algorithms for sparse polynomials	2023	Njaka Harilala Andriamandratomanana
+	Degree Bounds of Gröbner Bases	1994	Wei Li
+	8. Degree Formulas	2019	Christian Haesemeyer Charles A. Weibel
+ PDF Chat	Bounds for the degrees in polynomial equations	1991	Carlos A. Berenstein Alain Yger
+	Two short proofs of the bounded case of S.B. Rao’s degree sequence conjecture	2013	Vaidy Sivaraman

Works That Cite This (5)

Action	Title	Year	Authors
+	On the computational complexity of polynomials and bilinear mappings. A survey	1989	Joos Heintz
+	An Extension of Strassen’s Degree Bound	1981	C. P. Schnorr
+	Semi-algebraic decision complexity, the real spectrum, and degree	1996	Thomas Lickteig
+ PDF Chat	The Hardness of Polynomial Equation Solving	2003	David J. Castro M Giusti Joos Heintz Guillermo Matera Luis Miguel Pardo
+	Festschrift in honor of Arnold Schönhage	2005	Thomas Lickteig

Works Cited by This (0)

Action	Title	Year	Authors