scientific article; zbMATH DE number 16658
From MaRDI portal
Publication:3973344
[For the entire collection see Zbl 0721.00009.] Various notions of computing complexity in algebraic and semi-algebraic settings are discussed rather informally. Lower bounds for the complexity of a semi-algebraic set in \(\mathbb{R}^ n\) are derived and illustrated by examples.
Recommendations
- A geometric approach to complexity
- New Computational Paradigms
- The Complexity of Geometric Problems in High Dimension
- scientific article; zbMATH DE number 5302815
- scientific article; zbMATH DE number 1859221
- scientific article; zbMATH DE number 3995937
- Parametrized uniform complexity of computation in geometry and numerics
- Geometric complexity theory: an introduction for geometers
- Nonrealizability proofs in computational geometry
Cited in
(12)- A role of lower semicontinuous functions in the combinatorial complexity of geometric problems
- Test complexity of generic polynomials
- Verification complexity of linear prime ideals
- A measure for semialgebraic sets related to Boolean complexity
- A note on Rabin's width of a complete proof
- Lower bounds for arithmetic networks
- Lower bounds for arithmetic networks. II: Sum of Betti numbers
- Semi-algebraic decision complexity, the real spectrum, and degree
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
- scientific article; zbMATH DE number 16641 (Why is no real title available?)
- Parametrized uniform complexity of computation in geometry and numerics
- Kronecker's and Newton's approaches to solving: a first comparison
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)
