Pages that link to "Item:Q1096620"
From MaRDI portal
The following pages link to The complexity of elementary algebra and geometry (Q1096620):
Displayed 50 items.
- On information invariants in robotics (Q504012) (← links)
- Elementary recursive quantifier elimination based on Thom encoding and sign determination (Q529166) (← links)
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets (Q581617) (← links)
- Algebraic optimization: The Fermat-Weber location problem (Q584057) (← links)
- Condition number based complexity estimate for solving polynomial systems (Q629539) (← links)
- Linear solving for sign determination (Q638542) (← links)
- Deciding consistency of systems of exponential-polynomial inequalities in subexponential time (Q684954) (← links)
- Complexity of computation on real algebraic numbers (Q757065) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- On the complexity of \(p\)-adic basic semi-algebraic sets (Q883331) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Computational complexity of determining which statements about causality hold in different space-time models (Q949614) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Real addition and the polynomial hierarchy (Q1063589) (← links)
- A polynomial solution for the Potato-peeling problem (Q1076347) (← links)
- A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
- Real quantifier elimination is doubly exponential (Q1114669) (← links)
- A polynomial-time algorithm for the topological type of real algebraic curve (Q1115496) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Algebraic decomposition of regular curves (Q1116997) (← links)
- Existence and uniqueness of the real closure of an ordered field without Zorn's lemma (Q1176709) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals (Q1185456) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination (Q1185458) (← links)
- The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
- Detecting cusps and inflection points in curves (Q1195058) (← links)
- NC algorithms for real algebraic numbers (Q1201334) (← links)
- Counting connected components of a semialgebraic set in subexponential time (Q1207337) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- On computing a set of points meeting every cell defined by a family of polynomials on a variety (Q1361873) (← links)
- Finitely representable databases (Q1376408) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- Reachability and connectivity queries in constraint databases (Q1394800) (← links)
- Generic computation of the real closure of an ordered field. (Q1565819) (← links)
- Dynamic evaluation and real closure. (Q1565836) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces (Q1745633) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- A logic for reasoning about probabilities (Q1813497) (← links)
- Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) (Q1915805) (← links)
- The uniform measure of simple regular sets of infinite trees (Q2029602) (← links)
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination (Q2182734) (← links)
- Complexity of deciding the first-order theory of real closed fields (Q2277024) (← links)
- Reasoning about probabilistic sequential programs (Q2373709) (← links)
- (Q3384160) (← links)
- A ModalWalk Through Space (Q3647299) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- Tarski’s Influence on Computer Science (Q4611682) (← links)