scientific article; zbMATH DE number 3068536
From MaRDI portal
Publication:5807665
zbMath0044.25102MaRDI QIDQ5807665
Publication date: 1951
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Lower bounds on complexity of Lyapunov functions for switched linear systems, Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems, Synthesizing invariant barrier certificates via difference-of-convex programming, Ordered fields and Ł\(\Pi\frac{1}{2}\)-algebras, On the application of Buchberger's algorithm to automated geometry theorem proving, Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology, The complexity of elementary algebra and geometry, Holant problems for 3-regular graphs with complex edge functions, Computer algebra: Past and future, Termination of rewriting, Computing uniformly optimal strategies in two-player stochastic games, Polytopal and nonpolytopal spheres. An algorithmic approach, Mechanically proving termination using polynomial interpretations, On mechanical quantifier elimination for elementary algebra and geometry, Polynomial-time approximation schemes for circle and other packing problems, A bibliography of quantifier elimination for real closed fields, A note on the computation of the CP-rank, An improved projection operation for cylindrical algebraic decomposition of three-dimensional space, Some general incompleteness results for partial correctness logics, On the solvability of derived matrix problems, including completions and duals, Detection of Hopf bifurcations in chemical reaction networks using convex coordinates, Solving systems of polynomial inequalities in subexponential time, Bookmaking over infinite-valued events, Orderings for term-rewriting systems, Commuting tuples in reductive groups and their maximal compact subgroups., Parametric probabilistic transition systems for system design and analysis, Termination of linear programs with nonlinear constraints, Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions, A game-theoretic approach to fault diagnosis and identification of hybrid systems, On the complexity of quantified linear systems, Qualitative reasoning with directional relations, Dominance in the family of Sugeno-Weber t-norms, Analyzing ultimate positivity for solvable systems, Fast simplifications for Tarski formulas based on monomial inequalities, Variant quantifier elimination, Condition number based complexity estimate for solving polynomial systems, On the elementary theory of restricted real and imaginary parts of holomorphic functions, Groups elementarily equivalent to a free 2-nilpotent group of finite rank., An algorithm for determining copositive matrices, The area method. A recapitulation, Decidability in elementary analysis. II, Geometric reasoning with logic and algebra, Robust control of uncertain systems: classical results and recent developments, Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1, Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison, Rigidity of spherical codes, Efficient solution of a class of quantified constraints with quantifier prefix exists-forall, Quantifier elimination for a class of exponential polynomial formulas, Stochastic limit-average games are in EXPTIME, Property-directed incremental invariant generation, Proof synthesis and reflection for linear arithmetic, On information invariants in robotics, Lower bound on testing membership to a polyhedron by algebraic decision and computation trees, Computational complexity of determining which statements about causality hold in different space-time models, On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data, Lower bounds for polynomials of many variables, A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets, Kripke semantics for higher-order type theory applied to constraint logic programming languages, Tractability conditions for numeric CSPs, Deciding consistency of systems of exponential-polynomial inequalities in subexponential time, Using geometric rewrite rules for solving geometric problems symbolically, Nonnegative ranks, decompositions, and factorizations of nonnegative matrices, A numerical algorithm for zero counting. I: Complexity and accuracy, Projecting CLP(\({\mathcal R}\)) constraints, On the complexity of minimizing probabilistic and quantum automata, Elementary recursive quantifier elimination based on Thom encoding and sign determination, Box invariance in biologically-inspired dynamical systems, Some presentations of the real number field, A computational proof of complexity of some restricted counting problems, Quantification over propositional formulas in probability logic: decidability issues, Equivariant differential topology in an o-minimal expansion of the field of real numbers, Quasi-interpretations. A way to control resources, Hybrid automata, reachability, and systems biology, On metrics for probabilistic systems: definitions and algorithms, On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases, A revision of the proof of the Kepler conjecture, On sign conditions over real multivariate polynomials, Convex Sobolev inequalities derived from entropy dissipation, Algebraic optimization: The Fermat-Weber location problem, Some lower bounds for the complexity of the linear programming feasibility problem over the reals, Inclusion dynamics hybrid automata, Floodlight illumination of infinite wedges, Counting positive solutions for polynomial systems with real coefficients, Improving the fundamental theorem of algebra., Fitting a \(C^m\)-smooth function to data. II, An analysis of first-order logics of probability, On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds, Condition number based complexity estimate for computing local extrema, Multi-letter quantum finite automata: decidability of the equivalence and minimization of states, On ordered fields and definite functions, A semi-algebraic approach for asymptotic stability analysis, Differential dynamic logic for hybrid systems, Elimination of quantifiers in algebraic structures, Positive feedback may sometimes promote stability, A use of the method of interpretations for decidability or undecidability of measure spaces, A decision procedure for optimal polyhedron partitioning, Countable algebra and set existence axioms, Solving systems of polynomial inequalities over a real closed field in subexponential time, Another proof of the Tarski-Seidenberg theorem, A tool for deciding the satisfiability of continuous-time metric temporal logic, Termination proofs of well-moded logic programs via conditional rewrite systems, ON POSITIVE THEORIES OF GROUPS WITH REGULAR FREE LENGTH FUNCTIONS, Value Groups and Residue Fields of Models of Real Exponentiation, Polynomials over the reals in proofs of termination : from theory to practice, On the Impossibility of Strong Encryption Over $\aleph_0$, On Feedback Stabilization of Linear Switched Systems via Switching Signal Control, Global convergence of the gradient method for functions definable in o-minimal structures, Deciding first-order formulas involving univariate mixed trigonometric-polynomials, Between the Rings $${\mathbb Z}/p^n{\mathbb Z}$$ and the Ring $${\mathbb Z}_p$$: Issues of Axiomatizability, Definability and Decidability, On independent GKM-graphs without nontrivial extensions, Elementary invariants for quantified probability logic, The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices, On the complexity of analyticity in semi-definite optimization, An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert’s 17th problem, Verifying Switched System Stability With Logic, Concrete barriers to quantifier elimination in finite dimensional C*‐algebras, Decision problem for a class of univariate Pfaffian functions, Topological elementary equivalence of regular semi‐algebraic sets in three‐dimensional space, The lattice of definability: origins, recent developments, and further directions, Planar Convex Codes are Decidable, Computing with Tarski formulas and semi-algebraic sets in a web browser, On the number of integral binary n$n$‐ic forms having bounded Julia invariant, Surjective Nash maps between semialgebraic sets, Multiplicative structures and random walks in o-minimal groups, Unnamed Item, Matrix-F5 algorithms over finite-precision complete discrete valuation fields, Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function, Primitive recursive ordered fields and some applications, Beyond Bell's theorem: correlation scenarios, Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1, Hybrid Automata in Systems Biology: How Far Can We Go?, Finding at least one point in each connected component of a real algebraic set defined by a single equation, A survey of computational complexity results in systems and control, The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata, COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS, An empirical analysis of algorithms for partially Clairvoyant scheduling, Finding connected components of a semialgebraic set in subexponential time, Further Generalizations of Results on Structures of Continuous Functions, Approximate Verification of the Symbolic Dynamics of Markov Chains, An Almost Optimal Algorithm for Computing Nonnegative Rank, On the expressiveness of linear-constraint query languages for spatial databases, Logarithmic-exponential series, Hierarchical Reasoning for the Verification of Parametric Systems, Symbolic reachability computation for families of linear vector fields, Probabilistic solutions to some NP-hard matrix problems, Recurrence with affine level mappings is P-time decidable for CLP, Real World Verification, Automatic derivation of probabilistic inference rules, Validating numerical semidefinite programming solvers for polynomial invariants, Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs, Cylindrical algebraic decomposition using local projections, Mechanical Theorem Proving in Tarski’s Geometry, Direct Formal Verification of Liveness Properties in Continuous and Hybrid Dynamical Systems, Quantifier elimination by cylindrical algebraic decomposition based on regular chains, Logspace computations in graph products, Tame decompositions and collisions, Computing Amoebas, Lower bounds for polynomials of many variables, Finding connected components of a semialgebraic set in subexponential time, An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms, Ancilla-approximable quantum state transformations, Combining Isabelle and QEPCAD-B in the Prover’s Palette, Quantifier elimination and rectilinearization theorem for generalized quasianalytic algebras, The (B) Conjecture for Uniform Measures in the Plane, A Roadmap to Decidability, Existential Definability in Arithmetic, The Diophantine problem in the classical matrix groups, Computing the shape of the image of a multi-linear mapping is possible but computationally intractable: Theorems, Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets, Unnamed Item, The algebraic numbers definable in various exponential fields, Reachability and optimal control for linear hybrid automata: a quantifier elimination approach, Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets, Mathematics by machine, Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers, Sparse interpolation over finite fields via low-order roots of unity, Multivariate sparse interpolation using randomized Kronecker substitutions, Computing the differential Galois group of a parameterized second-order linear differential equation, A new deterministic algorithm for sparse multivariate polynomial interpolation, A fast algorithm for computing the characteristic polynomial of the p-curvature, Computing necessary integrability conditions for planar parametrized homogeneous potentials, Improved algorithm for computing separating linear forms for bivariate systems, Solving higher order linear differential equations having elliptic function coefficients, Parallel telescoping and parameterized Picard-Vessiot theory, A generalized Apagodu-Zeilberger algorithm, The asymptotic analysis of some interpolated nonlinear recurrence relations, Fast arithmetic for the algebraic closure of finite fields, On the computation of the topology of plane curves, Essentially optimal interactive certificates in linear algebra, Root counts of semi-mixed systems, and an application to counting nash equilibria, Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation), Sub-cubic change of ordering for Gröbner basis, Sparse Gröbner bases, The MMO problem, Factoring linear differential operators in n variables, Online order basis algorithm and its impact on the block Wiedemann algorithm, On isomorphisms of modules over non-commutative PID, Radical solutions of first order autonomous algebraic ordinary differential equations, Computing low-degree factors of lacunary polynomials, Maximum likelihood geometry in the presence of data zeros, Constructing fewer open cells by GCD computation in CAD projection, An a posteriori certification algorithm for Newton homotopies, Evaluating parametric holonomic sequences using rectangular splitting, Equivariant lattice generators and Markov bases, Sparse polynomial interpolation codes and their decoding beyond half the minimum distance, Sparse multivariate function recovery with a high error rate in the evaluations, Bounds for D-finite closure properties, Powers of tensors and fast matrix multiplication, Reduction among bracket polynomials, Formal solutions of a class of Pfaffian systems in two variables, On the reduction of singularly-perturbed linear differential systems, High performance implementation of the TFT, Randomized detection of extraneous factors, Toric border basis, On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases, A near-optimal algorithm for computing real roots of sparse polynomials, LLL reducing with the most significant bits, Covering of surfaces parametrized without projective base points, Linear independence oracles and applications to rectangular and low rank linear systems, Faster relaxed multiplication, Unimodular completion of polynomial matrices, Calibrating the Black-Derman-Toy model: some theoretical results, Tropicalizing the Simplex Algorithm, Verification of Hybrid Systems, Generating polynomial orderings for termination proofs, On the decidability of semigroup freeness, Leon Henkin the Reviewer, Applied Algebraic Geometry in Model Based Design for Manufacturing, On the norm of symmetrised two-sided multiplications, THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS, On the integer solutions of quadratic equations, Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates, A real analytic constructive proof of the lojasiewicz theorem, Solution theory for systems of bilinear equations, Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander, On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers, Formal Modelling, Analysis and Verification of Hybrid Systems, Bisimilarity of Diagrams, Ascending chains of ideals in the polynomial ring, Quantifying over events in probability logic: an introduction, Solving Nonlinear Integer Arithmetic with MCSAT, STORMED Hybrid Systems, Unnamed Item, Quelques propriétés du noyau d'un opérateur différentiel linéaire non hypoelliptique, à coefficients constants, On Σ‐definability without equality over the real numbers, Sur les anneaux factoriels, Decidable Compositions of O-Minimal Automata, Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets, Polynomial, regular and Nash images of Euclidean spaces, Course on Non-oscillatory Trajectories, A DECISION PROCEDURE FOR PROBABILITY CALCULUS WITH APPLICATIONS, Unnamed Item, Unnamed Item, Unnamed Item, Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm, Accurate and efficient expression evaluation and linear algebra, Completeness and Categoricity. Part I: Nineteenth-century Axiomatics to Twentieth-century Metalogic, Bracketing backward reach sets of a dynamical system, Sur la complexité du principe de Tarski-Seidenberg, On the Generation of Positivstellensatz Witnesses in Degenerate Cases, O-Minimal Invariants for Discrete-Time Dynamical Systems, GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS, Existence and uniqueness of equivariant triangulations of smooth proper G-manifolds with some applications to equivariant Whitehead torsion, Proving Termination of Context-Sensitive Rewriting with MU-TERM, Some decidable results on reachability of solvable systems, Quantifier elimination for elementary geometry and elementary affine geometry, Antiprismlessness, or: reducing combinatorial equivalence to projective equivalence in realizability problems for polytopes, Łojasiewicz inequalities with explicit exponents for smallest singular value functions, Geometric complexity of embeddings in \(\mathbb R^d\), Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries, Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation), A logic and computation for Popper's conditional probabilities, Complexity of linear relaxations in integer programming, An algorithm for generalized point location and its applications, On Tarski's assumptions, Über Polynomabbildungen, On the realisability of double-cross matrices by polylines in the plane, Precisely deciding CSL formulas through approximate model checking for CTMCs, The differential of probabilistic entailment, Real root finding for low rank linear matrices, Guaranteed tuning, with application to robust control and motion planning, Positive root isolation for poly-powers by exclusion and differentiation, The dimension method in elementary and differential geometry, Mechanical theorem proving in projective geometry, A category of geometric spaces: Some computational aspects, Nonsmooth rank-one matrix factorization landscape, Computation of polytopic invariants for polynomial dynamical systems using linear programming, Lipschitz continuity of tangent directions at infinity, NP-hardness of deciding convexity of quartic polynomials and related problems, Equivalence of state representations for hidden Markov models, An optimal quantum error-correcting procedure using quantifier elimination, Recognition of affine-equivalent polyhedra by their natural developments, Automatically discovering relaxed Lyapunov functions for polynomial dynamical systems, Discovering polynomial Lyapunov functions for continuous dynamical systems, On the infinite increase of a class of polynomials, Improved mixing condition on the grid for counting and sampling independent sets, Relational hidden variables and non-locality, Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem, Recent advances in automated theorem proving on inequalities, Fast theorem-proving and Wu's method, On the equivalence between (quasi-)perfect and sequential equilibria, Out of order quantifier elimination for standard quantified linear programs, Nonstandard decision methods for the solvability of real polynomial equations, Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates, Cylindrical algebraic decomposition using validated numerics, Taylor approximation for hybrid systems, On a decision procedure for quantified linear programs, Solution to the generalized champagne problem on simultaneous stabilization of linear systems, Deciding Koopman's qualitative probability, Analyzing probabilistic pushdown automata, Safety verification of non-linear hybrid systems is quasi-decidable, A class of mechanically decidable problems beyond Tarski's model, Elimination for generic sparse polynomial systems, Automated deduction and knowledge management in geometry, Algorithmic rationality: game theory with costly computation, Model-theoretic properties of \(\omega\)-automatic structures, Craig interpolation in the presence of unreliable connectives, On quantified linear implications, A combinatorial approach to nonlocality and contextuality, Monotonic hybrid systems, Computational complexity of diagram satisfaction in Euclidean geometry, The natural algorithmic approach of mixed trigonometric-polynomial problems, Quasi-decidability of a fragment of the first-order theory of real numbers, On triangular norms and uninorms definable in Ł\(\Pi \frac{1}{2}\), A testable model of consumption with externalities, Quasi-analyticity, o-minimality and quantifier elimination., Complexity of deciding the first-order theory of real closed fields, LTL over integer periodicity constraints, Twin paradox and the logical foundation of relativity theory, Quantum principles and mathematical computability, The uniform measure of simple regular sets of infinite trees, QPLIB: a library of quadratic programming instances, Well-posedness and convergence of a numerical scheme for the corrected Derrida-Lebowitz-Speer-Spohn equation using the Hellinger distance, Łojasiewicz-type inequalities with explicit exponents for the largest eigenvalue function of real symmetric polynomial matrices, Computing the homology of semialgebraic sets. I: Lax formulas, Zero-sum stochastic games over the field of real algebraic numbers, First-order orbit queries, Embedding two-ordered rings in one ordered ring. I, \(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\), Computing a Nonnegative Matrix Factorization---Provably, Race Against the Teens – Benchmarking Mechanized Math on Pre-university Problems, NIL: learning nonlinear interpolants, A.D. Taimanov and model theory in Kazakhstan, Deciding probabilistic bisimilarity distance one for probabilistic automata, Editorial: Symbolic computation and satisfiability checking, From simplification to a partial theory solver for non-linear real polynomial constraints, On the concept of categoricity, The weirdness theorem and the origin of quantum paradoxes, Incompleteness, Undecidability and Automated Proofs, Model theory of adeles. I., Solving problems by formula manipulation in logic and linear inequalities, Automatic a priori round-off analysis. I: Arithmetic conditions, Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants, An algebraic method to fidelity-based model checking over quantum Markov chains, \(\kappa\)-bounded exponential-logarithmic power series fields, An exact and efficient approach for computing a cell in an arrangement of quadrics, Measurable equidecompositions for group actions with an expansion property, \(\Sigma\)-presentations of the ordering on the reals, Special algorithm for stability analysis of multistable biological regulatory systems, Equations for formally real meadows, Geometric and o-minimal Littlewood-Offord problems, Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming, Decisiveness of stochastic systems and its application to hybrid models, Real or natural number interpretation and their effect on complexity, Formalization of Bernstein polynomials and applications to global optimization, Symbolic computation in Maude: some tapas, Book review of: M. Aschenbrenner et al., Asymptotic differential algebra and model theory of transseries, Polynomial utility, Formulation of linear problems and solution by a universal machine, Quantitative solution of omega-regular games, Perron-Frobenius theory over real closed fields and fractional power series expansions, 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, On Nash images of Euclidean spaces, Recognizing free generating sets of \(\ell\)-groups, Parallel algorithms for arrangements, 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, Real quantifier elimination is doubly exponential, Convergence on the iteration of Halley family in weak conditions, A polynomial-time algorithm for the topological type of real algebraic curve, Wu's method and its application to perspective viewing, The exact region of stability for MacCormack scheme, Finitely representable databases, Semialgebraic sets and some versions of the Tarski-Seidenberg-Macintyre theorem, On the algebraic formulation of certain geometry statements and mechanical geometry theorem proving, A Kochen-Specker system has at least 22 vectors, A refutational approach to geometry theorem proving, On the complexity of the robust stability problem for linear parameter varying systems, A lower bound for randomized algebraic decision trees, Randomization and the computational power of analytic and algebraic decision trees, Arrangement of 24 points on a sphere, Illumination by floodlights, On the computability of Nash equilibria, Queries with arithmetical constraints, A transfer method from bounded existential Diophantine equations to Tarski algebra formulas, Remarks on the complexity of roundoff analysis, Finiteness property for generalized abelian integrals., A note on simplification orderings, An implementation of Vincent's theorem, An elementary approach to subresultants theory., Almost periodic sequences., Semialgebraic topology over a real closed field. II: Basic theory of semialgebraic spaces, Tarski-type problems for free associative algebras, Decidable theories of preordered fields, A complete uniform substitution calculus for differential dynamic logic, What does a group algebra of a free group ``know about the group?, Subanalytic sets in the calculus of variation, Extensions of the natural approach to refinements and generalizations of some trigonometric inequalities, 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., Parallel postulates and continuity axioms: a mechanized study in intuitionistic logic using Coq, Sum-of-squares for bounded rationality, Complexity of computations in Commutative Division of the USSR Academy of Sciences, An effective decision method for semidefinite polynomials, Invariant computations for analytic projective geometry, Hypercomputation by definition, 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, Grid methods in computational real algebraic (and semialgebraic) geometry, Automatic generation of bounds for polynomial systems with application to the Lorenz system, Against the judgment-dependence of mathematics and logic, Counting connected components of a semialgebraic set in subexponential time, Rational choice and polynomial measurement models, Stronger-than-Lyapunov notions of matrix stability, or how ``flowers help solve problems in mathematical ecology, 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, Checking robust nonsingularity is NP-hard, Revelations of a gambler, A technique for proving decidability of containment and equivalence of linear constraint queries, Complexity of deciding Tarski algebra, The structure of the set of equilibria for two person multicriteria games., Stock cutting to minimize cutting length, A logic for reasoning about probabilities, Growing methods for constructing Recursive Deterministic Perceptron neural networks and knowledge extraction, On the coordinatization of oriented matroids, Probabilistic termination versus fair termination, Randomizing a model, Isomorphism theorem for BSS recursively enumerable sets over real closed fields, On approximate and algebraic computability over the real numbers, 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, 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, Deciding Hopf bifurcations by quantifier elimination in a software-component architecture, A recursive algorithm for constructing generalized Sturm sequence, Querying spatial databases via topological invariants, Topological queries in spatial databases, Complete geometric query languages, On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases, Symbolic model checking of timed guarded commands using difference decision diagrams, Quantified constraints under perturbation, An algorithm for isolating the real solutions of semi-algebraic systems, Characterizing the common prior assumption., Systems of rational polynomial equations have polynomial size approximate zeros on the average
