A new decision method for elementary algebra
From MaRDI portal
Publication:2651859
Cited in
(only showing first 100 items - show all)- Differential operators with constant coefficients of hyperbolic- (hypo)elliptic type
- Another proof of the Tarski-Seidenberg theorem
- Computer algebra: Past and future
- A bibliography of quantifier elimination for real closed fields
- A refutational approach to geometry theorem proving
- Computability of a map and decidability of its graph in the model of Blum, Shub and Smale
- Counting types of rigid frameworks
- Semialgebraic topology over a real closed field. II: Basic theory of semialgebraic spaces
- Lifting smooth homotopies of orbit spaces
- Applications of the blowing-up construction and algebraic geometry to bifurcation problems
- Subanalytic sets in the calculus of variation
- 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
- The mixed problem in a quarter space for systems of equations with constant coefficients which are correct in the sense of I. G. Petrovskii
- Stratification of real analytic mappings and images
- Rational choice and polynomial measurement models
- Caratterizzazione alla Paley-Wiener dei dati ai limiti per certi problemi ben posti secondo Shilov
- On invariant and covariant Schwartz distributions in the case of a compact linear group
- New techniques and results in multidimensional problems
- Types topologiques des polynômes
- Singularities of vector fields on the plane
- Numerical range of a matrix: Some effective criteria
- On the forgotten theorem of Mr. Vincent
- Complexity of deciding Tarski algebra
- Modified Nash triviality of a family of zero-sets of real polynomial mappings
- On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases
- Inferring 3D structure from image motion: The constraint of Poinsot motion
- Formulation of linear problems and solution by a universal machine
- Static output feedback -- a survey
- On a nonlocal two-point boundary value problem in a band for an equation with nonconstant coefficients
- On stabilizability of evolution systems of partial differential equations on \(\mathbb{R}^n\times [0,+\infty)\) by time-delayed feedback controls
- An effective decision method for semidefinite polynomials
- Computing two penetration measures for curved 2D objects
- Book review of: M. Aschenbrenner et al., Asymptotic differential algebra and model theory of transseries
- Recognizing free generating sets of \(\ell\)-groups
- Tensor decomposition and homotopy continuation
- Automated reducible geometric theorem proving and discovery by Gröbner basis method
- Sum-of-squares for bounded rationality
- A globally asymptotically stable polynomial vector field with rational coefficients and no local polynomial Lyapunov function
- A hybrid procedure for finding real points on a real algebraic set
- Automatic generation of bounds for polynomial systems with application to the Lorenz system
- Stronger-than-Lyapunov notions of matrix stability, or how ``flowers help solve problems in mathematical ecology
- The structure of the set of equilibria for two person multicriteria games.
- Computing the irreducible real factors and components of an algebraic curve
- L^ p matrix coefficients for nilpotent Lie groups
- Singularities of vector fields
- Real solving for positive dimensional systems.
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Perron-Frobenius theory over real closed fields and fractional power series expansions
- Semialgebraic sets and some versions of the Tarski-Seidenberg-Macintyre theorem
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Numerically computing real points on algebraic sets
- Recent advances in automated theorem proving on inequalities
- Nonstandard decision methods for the solvability of real polynomial equations
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- The weirdness theorem and the origin of quantum paradoxes
- Complexity aspects of local minima and related notions
- Measurable equidecompositions for group actions with an expansion property
- Euclidean distance degree and mixed volume
- Symbolic computation in Maude: some tapas
- On finiteness theorems of polynomial functions
- On the complexity of testing attainment of the optimal value in nonlinear optimization
- On the infinite increase of a class of polynomials
- Deciding Koopman's qualitative probability
- Finiteness of semialgebraic types of Nash mappings defined on a Nash surface
- Orbit spaces of linear circle actions
- Computing real witness points of positive dimensional polynomial systems
- Łojasiewicz inequalities with explicit exponents for smallest singular value functions
- On the division of distributions by polynomials
- Equivalence of state representations for hidden Markov models
- A review and prospect of readable machine proofs for geometry theorems
- On the equivalence between (quasi-)perfect and sequential equilibria
- Analytically equivalent ideals
- Characters of algebraic solvable groups
- Nonexistence of a continuous right inverse for surjective linear partial differential operators on the Fréchet spaces \(\gamma^{(\delta)}(\Omega)\)
- Hyperbolic equations and systems with multiple characteristics
- An algorithm for generalized point location and its applications
- The differential of probabilistic entailment
- Nonsmooth rank-one matrix factorization landscape
- Lipschitz continuity of tangent directions at infinity
- Recognition of affine-equivalent polyhedra by their natural developments
- Computing a nonnegative matrix factorization -- provably
- Lower bounds on complexity of Lyapunov functions for switched linear systems
- Completeness and categoricity (in power): formalization without foundationalism
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- Geometria combinatoria e geometrie finite
- Tropicalizing the simplex algorithm
- Applied Algebraic Geometry in Model Based Design for Manufacturing
- On the solvability of derived matrix problems, including completions and duals
- Résolution du problème de l'ellipse et du cercle par l'algorithme de Hörmander
- Singularly perturbed systems
- Generic 3-parameter families of vector fields on the plane, unfolding a singularity with nilpotent linear part. The cusp case of codimension 3
- Direct Integral Decompositions and Multiplicities for Induced Representations of Nilpotent Lie Groups
- Analytic and Differentiable Functions Vanishing on an Algebraic Set
- Tilings with congruent tiles
- Computability and the algebra of fields: Some affine constructions
- Quelques propriétés du noyau d'un opérateur différentiel linéaire non hypoelliptique, à coefficients constants
- scientific article; zbMATH DE number 3484386 (Why is no real title available?)
- scientific article; zbMATH DE number 3539070 (Why is no real title available?)
This page was built for publication: A new decision method for elementary algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2651859)