Publication | Closed Access

Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields

Computational Complexity TheoryEngineeringProof ComplexityAlgebraic ComplexityQuantifier EliminationFormal MethodsAlgebraic MethodFinite FieldComputational ComplexityTime ComplexityComputer SciencePrecise SequentialParallel Complexity Bounds