scientific article; zbMATH DE number 3068536

Cited in

(only showing first 100 items - show all)

Counting positive solutions for polynomial systems with real coefficients
Improving the fundamental theorem of algebra.
Fitting a C^m-smooth function to data. II
Condition number based complexity estimate for computing local extrema
A semi-algebraic approach for asymptotic stability analysis
Differential dynamic logic for hybrid systems
Positive feedback may sometimes promote stability
A use of the method of interpretations for decidability or undecidability of measure spaces
Countable algebra and set existence axioms
Another proof of the Tarski-Seidenberg theorem
On the application of Buchberger's algorithm to automated geometry theorem proving
The complexity of elementary algebra and geometry
Computer algebra: Past and future
Termination of rewriting
Polytopal and nonpolytopal spheres. An algorithmic approach
On mechanical quantifier elimination for elementary algebra and geometry
A bibliography of quantifier elimination for real closed fields
An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
Some general incompleteness results for partial correctness logics
Solving systems of polynomial inequalities in subexponential time
Real quantifier elimination is doubly exponential
A polynomial-time algorithm for the topological type of real algebraic curve
Wu's method and its application to perspective viewing
On the algebraic formulation of certain geometry statements and mechanical geometry theorem proving
A refutational approach to geometry theorem proving
On the complexity of the robust stability problem for linear parameter varying systems
Arrangement of 24 points on a sphere
A note on simplification orderings
An implementation of Vincent's theorem
Semialgebraic topology over a real closed field. II: Basic theory of semialgebraic spaces
Decidable theories of preordered fields
Subanalytic sets in the calculus of variation
Complexity of computations in Commutative Division of the USSR Academy of Sciences
Invariant computations for analytic projective geometry
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
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
On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
Wu's method and the Khovanskii finiteness theorem
The complexity of deciding consistency of systems of polynomials in exponent inequalities
A non-reified temporal logic
Counting connected components of a semialgebraic set in subexponential time
Rational choice and polynomial measurement models
New techniques and results in multidimensional problems
Algebraic equations for a class of P. L. spaces
Singularities of vector fields on the plane
Finite procedures for sofic systems
An efficient decision procedure for the theory of rational order
On the forgotten theorem of Mr. Vincent
Towards a model theory of statistical theories
Revelations of a gambler
Complexity of deciding Tarski algebra
Stock cutting to minimize cutting length
Growing methods for constructing Recursive Deterministic Perceptron neural networks and knowledge extraction
Randomizing a model
On approximate and algebraic computability over the real numbers
A general model completeness result for expansions of the real ordered field
An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
Topological queries in spatial databases
Complete geometric query languages
On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
Polynomial utility
Formulation of linear problems and solution by a universal machine
Buchberger's algorithm: The term rewriter's point of view
Static output feedback -- a survey
Complexity issues in robust stability of linear delay-differential systems
Convergence on the iteration of Halley family in weak conditions
Finitely representable databases
A lower bound for randomized algebraic decision trees
Randomization and the computational power of analytic and algebraic decision trees
Illumination by floodlights
On the computability of Nash equilibria
Queries with arithmetical constraints
Remarks on the complexity of roundoff analysis
Finiteness property for generalized abelian integrals.
An elementary approach to subresultants theory.
Almost periodic sequences.
Limits of theory sequences over algebraically closed fields and applications.
An effective version of Wilkie's theorem of the complement and some effective o-minimality results.
An effective decision method for semidefinite polynomials
Hypercomputation by definition
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
Stability of bundles of dynamic systems and related problems
Definability of the ring of integers in pro-p Galois extensions of number fields
Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition
Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
Querying spatial databases via topological invariants
Quantified constraints under perturbation
Book review of: M. Aschenbrenner et al., Asymptotic differential algebra and model theory of transseries
On Nash images of Euclidean spaces
Recognizing free generating sets of \(\ell\)-groups
Automatic synthesis of logical models for order-sorted first-order theories
First-order decidability and definability of integers in infinite algebraic extensions of the rational numbers
A Kochen-Specker system has at least 22 vectors
A transfer method from bounded existential Diophantine equations to Tarski algebra formulas
Tarski-type problems for free associative algebras
A complete uniform substitution calculus for differential dynamic logic
What does a group algebra of a free group ``know about the group?
Extensions of the natural approach to refinements and generalizations of some trigonometric inequalities
Parallel postulates and continuity axioms: a mechanized study in intuitionistic logic using Coq
Sum-of-squares for bounded rationality

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 Q5807665)