Parallel Time and Quantifier Prfixes
Résumé
We characterize the amount of alternation between blocks of digital quantifiers (having both existential and universal), blocks of real existential quantifiers, and blocks of real universal quantifiers that can be decided in parallel polynomial time over the reals. We do so under the assumption that blocks have a uniform bound in their size, both for the case of this bound to be polynomial and constant. As a result of this characterization (and as a stepping stone towards it) we prove a real version of Savitch Theorem.
Domaines
Complexité [cs.CC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...