scientific article; zbMATH DE number 3497890

zbMath0318.02051MaRDI QIDQ4079605

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Analysis of algorithms and problem complexity (68Q25) Model-theoretic algebra (03C60) Connections between field theory and logic (12L99) Cylindric and polyadic algebras; relation algebras (03G15) Algorithms in computer science (68W99) Totally real fields (11R80)

Related Items

Termination proofs of well-moded logic programs via conditional rewrite systems, Curtains in CAD: Why Are They a Problem and How Do We Fix Them?, Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks, A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs, Diffusive Influence Systems, Recent Advances in Real Geometric Reasoning, Verification of Hybrid Systems, Generating polynomial orderings for termination proofs, Applied Algebraic Geometry in Model Based Design for Manufacturing, Iterative methods of program analysis: Equalities and inequalities, Satisfiability Checking: Theory and Applications, Size-based termination of higher-order rewriting, On Ray Shooting for Triangles in 3-Space and Related Problems, The Optimal Packing of Eight Points in the Real Projective Plane, Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics, A parameter space method for analyzing Hopf bifurcation of fractional-order nonlinear systems with multiple-parameter, Isolating all the real roots of a mixed trigonometric-polynomial, Verification Modulo theories, Semantics of computable physical models, Stability analysis of a bacterial growth model through computer algebra, Deciding first-order formulas involving univariate mixed trigonometric-polynomials, Lazard-style CAD and Equational Constraints, Using Symbolic Computation to Analyze Zero-Hopf Bifurcations of Polynomial Differential Systems, VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities, Digital collections of examples in mathematical sciences, Experiments with automated reasoning in the class, Revealing Bistability in Neurological Disorder Models By Solving Parametric Polynomial Systems Geometrically, Early Ending in Homotopy Path-Tracking for Real Roots, Regular cylindrical algebraic decomposition, Moving regular k-gons in contact, Proving an execution of an algorithm correct?, An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert’s 17th problem, Nonlinear algebra and applications, Topological classification of the intersection curves of two quadrics using a set of discriminants, Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition, Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom?, Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test, Synthesising programs with non-trivial constants, A connected component labeling algorithm for implicitly defined domains, Methodologies of Symbolic Computation, New inequalities for \(p(n)\) and \(\log p(n)\), Computing with Tarski formulas and semi-algebraic sets in a web browser, Phenotype space and kinship assignment for the simpson index, Stanley's Lemma and Multiple Theta Functions, Inequalities for the modified Bessel function of first kind of non-negative order, A decidable theory involving addition of differentiable real functions, Tarski’s Influence on Computer Science, Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations, Constraint Satisfaction Problems over Numeric Domains, Decision algorithms for some fragments of analysis and related areas, Optimal Triangulation with Steiner Points, Hybrid Automata in Systems Biology: How Far Can We Go?, Computer algebra methods in the study of nonlinear differential systems, Finding connected components of a semialgebraic set in subexponential time, A Computer Proof of Moll’s Log-Concavity Conjecture, The dodecahedral conjecture, Simple CAD construction and its applications, Toward the best constant factor for the Rademacher-Gaussian tail comparison, Unnamed Item, New algorithms for the perspective-three-point problem, Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions, Symbolic reachability computation for families of linear vector fields, Improved projection for cylindrical algebraic decomposition, Complexity of cylindrical decompositions of sub-Pfaffian, Explicit factors of some iterated resultants and discriminants, Unnamed Item, Two-view ``cylindrical decomposition of binary images, 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, Packings in Real Projective Spaces, Tracing index of rational curve parametrizations, Invariant Synthesis for Combined Theories, Cylindrical algebraic decomposition using local projections, Direct Formal Verification of Liveness Properties in Continuous and Hybrid Dynamical Systems, Reasoning Algebraically About P-Solvable Loops, Computing roadmaps of semi-algebraic sets on a variety, A Matrix Positivstellensatz with Lifting Polynomials, Mechanically proving geometry theorems using a combination of Wu's method and Collins' method, Disproof of a conjecture by Rademacher on partial fractions, Exact Lower Bounds for Monochromatic Schur Triples and Generalizations, Sur la complexité du principe de Tarski-Seidenberg, Effective de Rham cohomology — The general case, Finding connected components of a semialgebraic set in subexponential time, Exact Algorithms for Linear Matrix Inequalities, Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints, On a Hybrid Symbolic-Connectionist Approach for Modeling the Kinematic Robot Map - and Benchmarks for Computer Algebra, Combinatorial Representation of Parameter Space for Switching Networks, Definable Sets in Ordered Structures. II, Globally Optimizing Small Codes in Real Projective Spaces, Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness, Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems, Implicit semi-algebraic abstraction for polynomial dynamical systems, Interpolation and model checking for nonlinear arithmetic, Formulation of linear problems and solution by a universal machine, Multivariate discriminant and iterated resultant, Inverse inequality estimates with symbolic computation, 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, \textit{Theorema}: Towards computer-aided mathematical theory exploration, Real quantifier elimination is doubly exponential, Parallel computational geometry, An algorithmic approach to some problems in terrain navigation, Quantifier elimination for the reals with a predicate for the powers of two, 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, Termination of linear programs with nonlinear constraints, An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination, Dominance in the family of Sugeno-Weber t-norms, Multiphase until formulas over Markov reward models: an algebraic approach, A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces, Analyzing ultimate positivity for solvable systems, Trading order for degree in creative telescoping, Change-of-bases abstractions for non-linear hybrid systems, Condition number based complexity estimate for solving polynomial systems, An algorithm for determining copositive matrices, Nonrealizability proofs in computational geometry, Triangulating a nonconvex polytope, Combinatorial complexity bounds for arrangements of curves and spheres, Solving nonlinear systems with least significant bit accuracy, Geometric reasoning with logic and algebra, Cylindrical decomposition for systems transcendental in the first variable, Solving parametric piecewise polynomial systems, Divide and conquer roadmap for algebraic sets, Deciding polynomial-transcendental problems, Complexity of computations in Commutative Division of the USSR Academy of Sciences, Zeros of univariate interval polynomials, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Quantifier elimination for a class of exponential polynomial formulas, Computation of topological invariants for real projective surfaces with isolated singularities, A baby step-giant step roadmap algorithm for general algebraic sets, Computing the homology of real projective sets, On using Lazard's projection in CAD construction, Proving inequalities and solving global optimization problems via simplified CAD projection, 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, On the positivity of the Gillis-Reznick-Zeilberger rational function, Partial cylindrical algebraic decomposition for quantifier elimination, A note on dead-beat controllability of generalised Hammerstein systems, Testing elementary function identities using CAD, Proof synthesis and reflection for linear arithmetic, The complexity of deciding consistency of systems of polynomials in exponent inequalities, Towards exact geometric computation, Search for shortest path around semialgebraic obstacles in the plane, Positivity of certain sums over Jacobi kernel polynomials, A transfer theorem in constructive \(p\)-adic algebra, A search-based procedure for nonlinear real arithmetic, Using geometric rewrite rules for solving geometric problems symbolically, A numerical algorithm for zero counting. I: Complexity and accuracy, Structural types for systems of equations: type refinements for structurally dynamic first-class modular systems of equations, Elementary recursive quantifier elimination based on Thom encoding and sign determination, A computational proof of complexity of some restricted counting problems, Counting connected components of a semialgebraic set in subexponential time, Hybrid automata, reachability, and systems biology, Real solution isolation with multiplicity of zero-dimensional triangular systems, On the computation of an arrangement of quadrics in 3D, Bounds on the number of steps of WDS required for checking the positivity of integral forms, On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases, Some new results on decidability for elementary algebra and geometry, Properness defects of projection and minimal discriminant variety, Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets, The computation of polynomial greatest common divisors over an algebraic number field, Some lower bounds for the complexity of the linear programming feasibility problem over the reals, Inclusion dynamics hybrid automata, On the forgotten theorem of Mr. Vincent, Topology and arrangement computation of semi-algebraic planar curves, Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen, Complexity of deciding Tarski algebra, Complexity of computation on real algebraic numbers, 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, Fields of algebraic numbers computable in polynomial time. I, 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, The real-algebraic structure of Scott's model of intuitionistic analysis, Definability and fast quantifier elimination in algebraically closed fields, Real addition and the polynomial hierarchy, Solving systems of polynomial inequalities over a real closed field in subexponential time, Description of the connected components of a semialgebraic set in single exponential time, Algorithms to compute the topology of orientable real algebraic surfaces, A heuristic prover for elementary analysis in \textit{Theorema}, Almost tight upper bounds for lower envelopes in higher dimensions, High-order quadrature on multi-component domains implicitly defined by multivariate polynomials, Computing the Betti numbers of arrangements via spectral sequences, Qualitative investigation of a gene model using computer algebra algorithms, Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation), Pegasus: sound continuous invariant generation, Triangles in space or building (and analyzing) castles in the air, An algorithm for generalized point location and its applications, On the computation of limsups, Algebraic degrees of 3-dimensional polytopes, Nearly sharp complexity bounds for multiprocessor algebraic computations, On the realisability of double-cross matrices by polylines in the plane, Finitely representable databases, Polynomial interrupt timed automata: verification and expressiveness, 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, Numerical roadmap of smooth bounded real algebraic surface, Modular strategic SMT solving with \textbf{SMT-RAT}, Subquadratic algorithms for algebraic 3SUM, On the robustness and optimality of algebraic multilevel methods for reaction-diffusion type problems, Queries with arithmetical constraints, Reachability and connectivity queries in constraint databases, Double Sylvester sums for subresultants and multi-Schur functions., On the average complexity for the verification of compatible sequences, On solving parametric polynomial systems, A review and prospect of readable machine proofs for geometry theorems, Open weak CAD and its applications, Time-bounded termination analysis for probabilistic programs with delays, \(p\)-irreducibility of binding polynomials, Visualizing planar and space implicit real algebraic curves with singularities, Recent advances in automated theorem proving on inequalities, Parallel computation of real solving bivariate polynomial systems by zero-matching method, A nonlinear moment model for radiative transfer equation in slab geometry, \(\epsilon\)-semantics computations on biological systems, 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, Out of order quantifier elimination for standard quantified linear programs, An automated prover for Zermelo-Fraenkel set theory in Theorema, Cylindrical algebraic decomposition using validated numerics, Computing the first few Betti numbers of semi-algebraic sets in single exponential time, An elementary proof of Sylvester's double sums for subresultants, Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials, Guaranteeing the homotopy type of a set defined by non-linear inequalities, Polynomial bivariate copulas of degree five: characterization and some particular inequalities, Automated deduction and knowledge management in geometry, Grid methods in computational real algebraic (and semialgebraic) geometry, A local Fourier convergence analysis of a multigrid method using symbolic computation, Validity proof of Lazard's method for CAD construction, On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem, Construction of explicit Runge-Kutta pairs with stiffness detection, Using machine learning to improve cylindrical algebraic decomposition, Checking existence of solutions of partial differential equations in the fields of Laurent series, On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting, Complexity of deciding the first-order theory of real closed fields, On exact Reznick, Hilbert-Artin and Putinar's representations, The uniform measure of simple regular sets of infinite trees, Global stabilization of nonlinear systems via hybrid implementation of dynamic continuous-time local controllers, Hopf bifurcations in a predator-prey model with an omnivore, Efficiently and effectively recognizing toricity of steady state varieties, A logic based approach to finding real singularities of implicit ordinary differential equations, Computing the homology of semialgebraic sets. I: Lax formulas, 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, A conflict-driven solving procedure for poly-power constraints, Editorial: Symbolic computation and satisfiability checking, Fully incremental cylindrical algebraic decomposition, Cylindrical algebraic decomposition with equational constraints, From simplification to a partial theory solver for non-linear real polynomial constraints, Computing and using minimal polynomials, Revisiting reachability in polynomial interrupt timed automata, Congruence, similarity, and symmetries of geometric objects, On multivariate Hermitian quadratic forms, Symbolic computation for the qualitative theory of differential equations, Stability of bundles of dynamic systems and related problems, Deciding Hopf bifurcations by quantifier elimination in a software-component architecture, Verifying safety and persistence in hybrid systems using flowpipes and continuous invariants, An exact and efficient approach for computing a cell in an arrangement of quadrics, Neurons on amoebae, Smooth points on semi-algebraic sets, Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure, Special algorithm for stability analysis of multistable biological regulatory systems, Symbolic model checking of timed guarded commands using difference decision diagrams, 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, Quantified constraints under perturbation, 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, An algorithm for isolating the real solutions of semi-algebraic systems, Generating invariants for non-linear hybrid systems