scientific article; zbMATH DE number 3068536
From MaRDI portal
Publication:5807665
zbMath0044.25102MaRDI QIDQ5807665
No author found.
Publication date: 1951
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
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 ⋮ Cylindrical algebraic decomposition using local projections ⋮ 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 ⋮ Verified Quadratic Virtual Substitution for Real Arithmetic ⋮ Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs ⋮ Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates ⋮ 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
This page was built for publication:
