Verification complexity of linear prime ideals

DOI10.1016/0022-4049(92)90059-OzbMath0768.68035OpenAlexW2034721789MaRDI QIDQ1207526

Peter Bürgisser, Thomas Lickteig

Publication date: 1 April 1993

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(92)90059-o

zbMATH Keywords

lower boundsalgebraic complexity theorydecision complexityzerosets of polynomialscomplexity of algebraic decision treeslinear prime ideals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of algebraic surfaces (14Q10)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplicative complexity of some rational functions
• Test complexity of generic polynomials
• A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
• Semi-algebraic decision complexity, the real spectrum, and degree
• Berechnung und Programm. I
• The Computational Complexity of Continued Fractions
• Lower bounds for algebraic decision trees
• Additive Complexity and Zeros of Real Polynomials
• Rabin's width of a complete proof and the width of a semialgebraic set
• On the number of multiplications necessary to compute certain functions

This page was built for publication: Verification complexity of linear prime ideals