Skip to main content
Conference Proceedings

Separating complexity classes related to bounded alternating ω-branching programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 762 LNCS 379-388
DOI: 10.1007/3-540-57568-5_269
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

By means of algebraical rank arguments we derive some exponential lower bounds on the size of bounded alternating ω-branching programs. Together with some polynomial upper bounds these lower bounds make possible the complete separation of the restricted complexity classes NLba, co-NLba, ⊕Lba, MODp-Lba, p prime.

Cite

CITATION STYLE

APA

Meinel, C., & Waack, S. (1993). Separating complexity classes related to bounded alternating ω-branching programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 762 LNCS, pp. 379–388). Springer Verlag. https://doi.org/10.1007/3-540-57568-5_269

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free