scientific article; zbMATH DE number 16658

MaRDI QIDQ3973344zbMATH OpenFDO

Authors Tomas Recio, J. L. Montaña, Luis Miguel Pardo

Publication date 26 June 1992

zbMATH Keywords

complexity of a semi-algebraic set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects in algebraic geometry (14Q99) Semialgebraic sets and related spaces (14P10)

Recommendations

• A geometric approach to complexity
• New Computational Paradigms
• The Complexity of Geometric Problems in High Dimension
• scientific article
• scientific article; zbMATH DE number 1859221
• Publication:4723927
• Parametrized uniform complexity of computation in geometry and numerics
• Geometric complexity theory: an introduction for geometers
• Nonrealizability proofs in computational geometry

Cited in

(11)

• Semi-algebraic decision complexity, the real spectrum, and degree
• Verification complexity of linear prime ideals
• Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
• Kronecker's and Newton's approaches to solving: a first comparison
• A measure for semialgebraic sets related to Boolean complexity
• A note on Rabin's width of a complete proof
• Test complexity of generic polynomials
• Lower bounds for arithmetic networks. II: Sum of Betti numbers
• scientific article; zbMATH DE number 16641 (Why is no real title available?)
• Lower bounds for arithmetic networks
• Parametrized uniform complexity of computation in geometry and numerics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973344)