scientific article; zbMATH DE number 4014674

MaRDI QIDQ3026977zbMATH OpenFDO

Authors Dima Grigoriev

Publication date 1986

zbMATH Keywords

algorithm for quantifier eliminationfirst order theory of algebraically closed fieldspolynomial complexity

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10) Complexity of computation (including implicit computational complexity) (03D15) Polynomials in real and complex fields: factorization (12D05)

Recommendations

• scientific article; zbMATH DE number 3895043
• scientific article; zbMATH DE number 4150340
• Definability and fast quantifier elimination in algebraically closed fields
• On the combinatorial and algebraic complexity of quantifier elimination
• A formal quantifier elimination for algebraically closed fields

Cited in

(12)

• Complexity of computations in Commutative Division of the USSR Academy of Sciences
• On the number of sets definable by polynomials
• Stability of bundles of dynamic systems and related problems
• Quantifier elimination over finite fields using Gröbner bases
• The complexity of definability by open first-order formulas
• scientific article; zbMATH DE number 4150340 (Why is no real title available?)
• scientific article; zbMATH DE number 4152348 (Why is no real title available?)
• A formal quantifier elimination for algebraically closed fields
• scientific article; zbMATH DE number 3895043 (Why is no real title available?)
• A roadmap to decidability
• Specification by quantifier-free theory of superlinear inequalities and complexity of its decidability
• Definability and fast quantifier elimination in algebraically closed fields

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 Q3026977)