scientific article; zbMATH DE number 3497890
From MaRDI portal
Publication:4079605
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 (only showing first 100 items - show all)
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
This page was built for publication:
