scientific article; zbMATH DE number 3497890
From MaRDI portal
Publication:4079605
Cited in
(only showing first 100 items - show all)- Using computer algebra techniques for the specification, verification and synthesis of recursive programs
- Condition number based complexity estimate for computing local extrema
- Isolating the real roots of the piecewise algebraic variety
- Iterated discriminants
- Isotopic triangulation of a real algebraic surface
- A semi-algebraic approach for asymptotic stability analysis
- Real zeros of the zero-dimensional parametric piecewise algebraic variety
- The real-algebraic structure of Scott's model of intuitionistic analysis
- Real addition and the polynomial hierarchy
- The complexity of elementary algebra and geometry
- Computer algebra: Past and future
- Termination of rewriting
- History and basic features of the critical-pair/completion procedure
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Solving systems of polynomial inequalities in subexponential time
- Real quantifier elimination is doubly exponential
- Parallel computational geometry
- An algorithmic approach to some problems in terrain navigation
- Geometry theorem proving by decomposition of quasi-algebraic sets: An application of the Ritt-Wu principle
- A survey of motion planning and related geometric algorithms
- A refutational approach to geometry theorem proving
- Solving nonlinear systems with least significant bit accuracy
- Complexity of computations in Commutative Division of the USSR Academy of Sciences
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- 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. II: The general decision problem. Preliminaries for quantifier elimination
- Partial cylindrical algebraic decomposition for quantifier elimination
- The complexity of deciding consistency of systems of polynomials in exponent inequalities
- Search for shortest path around semialgebraic obstacles in the plane
- A transfer theorem in constructive \(p\)-adic algebra
- Counting connected components of a semialgebraic set in subexponential time
- On the forgotten theorem of Mr. Vincent
- Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
- Complexity of deciding Tarski algebra
- A computational method for determining strong stabilizability of \(n\)-D systems
- A complete discrimination system for polynomials with complex coefficients and its automatic generation
- Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach
- On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
- Description of the connected components of a semialgebraic set in single exponential time
- Formulation of linear problems and solution by a universal machine
- Almost tight upper bounds for lower envelopes in higher dimensions
- On the computation of limsups
- Nearly sharp complexity bounds for multiprocessor algebraic computations
- Finitely representable databases
- Queries with arithmetical constraints
- Reachability and connectivity queries in constraint databases
- Double Sylvester sums for subresultants and multi-Schur functions.
- Stability of bundles of dynamic systems and related problems
- Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
- Quantified constraints under perturbation
- On the robustness and optimality of algebraic multilevel methods for reaction-diffusion type problems
- Open weak CAD and its applications
- Global optimization of polynomials over real algebraic sets
- A hybrid procedure for finding real points on a real algebraic set
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- Grid methods in computational real algebraic (and semialgebraic) geometry
- Validity proof of Lazard's method for CAD construction
- Congruence, similarity, and symmetries of geometric objects
- Symbolic model checking of timed guarded commands using difference decision diagrams
- An algorithm for isolating the real solutions of semi-algebraic systems
- Algorithms to compute the topology of orientable real algebraic surfaces
- Computing the Betti numbers of arrangements via spectral sequences
- Guaranteed tuning, with application to robust control and motion planning
- The dimension method in elementary and differential geometry
- Mechanical theorem proving in projective geometry
- A category of geometric spaces: Some computational aspects
- On the average complexity for the verification of compatible sequences
- On solving parametric polynomial systems
- \(p\)-irreducibility of binding polynomials
- Recent advances in automated theorem proving on inequalities
- Automated deduction and knowledge management in geometry
- Using machine learning to improve cylindrical algebraic decomposition
- Checking existence of solutions of partial differential equations in the fields of Laurent series
- On exact Reznick, Hilbert-Artin and Putinar's representations
- The uniform measure of simple regular sets of infinite trees
- Efficiently and effectively recognizing toricity of steady state varieties
- A logic based approach to finding real singularities of implicit ordinary differential equations
- Bad projections of the PSD cone
- First-order orbit queries
- The impact on the properties of the EFGM copulas when extending this family
- Computing the homology of semialgebraic sets. II: General formulas
- Revisiting reachability in polynomial interrupt timed automata
- Symbolic computation for the qualitative theory of differential equations
- Neurons on amoebae
- Smooth points on semi-algebraic sets
- Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
- Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
- ``Test two, choose the better leads to high cooperation in the centipede game
- A comparison of algorithms for proving positivity of linearly recurrent sequences
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis
- A heuristic prover for elementary analysis in \textit{Theorema}
- High-order quadrature on multi-component domains implicitly defined by multivariate polynomials
- Pegasus: sound continuous invariant generation
- Algebraic degrees of 3-dimensional polytopes
- Real root finding for low rank linear matrices
- Numerical roadmap of smooth bounded real algebraic surface
- Time-bounded termination analysis for probabilistic programs with delays
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 Q4079605)
