scientific article
DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200111)47:4<493::AID-MALQ493>3.0.CO;2-S" /><493::AID-MALQ493>3.0.CO;2-S 10.1002/1521-3870(200111)47:4<493::AID-MALQ493>3.0.CO;2-SzbMath0989.03032MaRDI QIDQ2765572
Publication date: 16 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machineinfinite Abelian groupspolynomial hierarchy\(\text{P}\neq\text{NP}\)algorithmic quantifier elimination
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (1)
This page was built for publication:
