Berechnung und Programm. I
From MaRDI portal
Publication:2557558
DOI10.1007/BF00289512zbMath0252.68018MaRDI QIDQ2557558
Publication date: 1972
Published in: Acta Informatica (Search for Journal in Brave)
Related Items
Some computational problems in linear algebra as hard as matrix multiplication, Irreducibility of multivariate polynomials, Feasible arithmetic computations: Valiant's hypothesis, Application of separability and independence notions for proving lower bounds of circuit complexity, The complexity of partial derivatives, 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, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, Complexity bounds in elimination theory -- a survey., The Projective Noether Maple Package: Computing the dimension of a projective variety, On the representation of rational functions of bounded complexity, Semi-algebraic decision complexity, the real spectrum, and degree, Fast exponentiation using the truncation operation, On the efficiency of effective Nullstellensätze, Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten, Berechnung und Programm. II, Berechnungen in partiellen Algebren endlichen Typs, Boolean circuits versus arithmetic circuits
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
