Elimination of constants from machines over algebraically closed fields

DOI10.1006/JCOM.1997.0433zbMATH Open0878.68066OpenAlexW1984469422MaRDI QIDQ1361877FDOQ1361877

Authors: Pascal Koiran 

Publication date: 26 August 1997

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0ac6e3306791b66cc3da08c9cb1800d1b8214382

Recommendations

• Erratum: Elimination of constants from machines over algebraically closed fields
• scientific article; zbMATH DE number 3895043
• A formal quantifier elimination for algebraically closed fields
• Quantifier elimination in pairs of algebraically closed fields
• Definability and fast quantifier elimination in algebraically closed fields
• scientific article; zbMATH DE number 3946096
• Quantifier elimination over finite fields using Gröbner bases
• scientific article; zbMATH DE number 3563068
• Alfred Tarski's elimination theory for real closed fields
• scientific article; zbMATH DE number 1157650

zbMATH Keywords

discrete complexity theory

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Title not available (Why is that?)
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• A note on a \(P \neq NP\) result for a restricted class of real machines
• On the efficiency of effective Nullstellensätze
• On $ω_1$-categorical theories of fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Accessible telephone directories
• Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
• A survey on real structural complexity theory
• Title not available (Why is that?)
• Shattering All Sets of ‘k’ Points in “General Position” Requires (k — 1)/2 Parameters

Cited In (5)

• Elimination of parameters in the polynomial hierarchy
• Saturation and stability in the theory of computation over the reals
• On sets of linear forms of maximal complexity
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
• The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete.

This page was built for publication: Elimination of constants from machines over algebraically closed fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361877)