SAT is NP-complete, QBF is PSPACE-complete, DQBF is NEXPTIME-complete. Is there any extension of QBF or restriction of DQBF that is EXPTIME-complete?Added later: a definition of DQBF can be found here: https://www.react.uni-saarland.de/publications/sat14.pdf
EXPTIME-complete propositional satisfiability problem
cc.complexity theory