Exotic Quantifiers, Complexity Classes, and Complete Problems

DOI10.1007/978-3-540-73420-8_20zbMATH Open1171.68481OpenAlexW1482052057MaRDI QIDQ5428810

Felipe Cucker, Peter Bürgisser

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_20

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

QUIXO is EXPTIME-complete ⋮ Exotic quantifiers, complexity classes, and complete problems

This page was built for publication: Exotic Quantifiers, Complexity Classes, and Complete Problems

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