DocumentCode :
3328422
Title :
Making nondeterminism unambiguous
Author :
Reinhardt, Klaus ; Allender, Eric
Author_Institution :
Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany
fYear :
1997
fDate :
20-22 Oct 1997
Firstpage :
244
Lastpage :
253
Abstract :
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as: NL/poly=UL/poly LogCFL/poly=UAuxPDA(log n, nO(1))/poly
Keywords :
computational complexity; complexity classes; context-free languages; nondeterminism; nondeterministic logarithmic space bounded computation; nonuniform complexity; Complexity theory; Computer networks; Computer science; Microwave integrated circuits; Switching circuits;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on
Conference_Location :
Miami Beach, FL
ISSN :
0272-5428
Print_ISBN :
0-8186-8197-7
Type :
conf
DOI :
10.1109/SFCS.1997.646113
Filename :
646113
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3328422
بازگشت