Berechnung und Programm. I

DOI10.1007/BF00289512zbMath0252.68018OpenAlexW4250775169MaRDI QIDQ2557558

Volker Strassen

Publication date: 1972

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289512

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic structures (08Axx)

Related Items

Irreducibility of multivariate polynomials, Fast exponentiation using the truncation operation, On the efficiency of effective Nullstellensätze, A tight bound for approximating the square root, Boolean circuits versus arithmetic circuits, Feasible arithmetic computations: Valiant's hypothesis, Semi-algebraic decision complexity, the real spectrum, and degree, Application of separability and independence notions for proving lower bounds of circuit complexity, The complexity of partial derivatives, Some computational problems in linear algebra as hard as matrix multiplication, Verification complexity of linear prime ideals, Die Berechnungskomplexität der symbolischen Differentiation von Interpolationspolynomen, A survey of techniques in applied computational complexity, Realizing Boolean functions on disjoint sets of variables, Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics, Some elementary proofs of lower bounds in complexity theory, On the representation of rational functions of bounded complexity, Complexity bounds in elimination theory -- a survey., Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten, Berechnung und Programm. II, Berechnungen in partiellen Algebren endlichen Typs, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, The Projective Noether Maple Package: Computing the dimension of a projective variety

Cites Work

• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Berechnungen in partiellen Algebren endlichen Typs
• On the number of multiplications necessary to compute certain functions
• Further Pathologies in Algebraic Geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item