Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Formal Languages (F.4.3) > Classes Defined By Resource-Bounded Automata (F.4.3...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-1 of 1 Reviews about "Classes Defined By Resource-Bounded Automata (F.4.3...)": Date Reviewed   Nondeterministic space is closed under complementation Immerman N. (ed) SIAM Journal on Computing 17(5): 935-938, 1988.  Type: Article For almost two decades the P vs. NP question has vexed computer scientists, perhaps because of a lack of understanding of the power of nondeterminism. This paper represents a truly significant adva... Jul 1 1989
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy