IEEE - Institute of Electrical and Electronics Engineers, Inc. - Making nondeterminism unambiguous

Proceedings 38th Annual Symposium on Foundations of Computer Science

Author(s): Reinhardt, K. ; Allender, E.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1997
Conference Location: Miami Beach, FL, USA, USA
Conference Date: 20 October 1997
Page(s): 244 - 253
ISBN (Paper): 0-8186-8197-7
ISSN (Paper): 0272-5428
DOI: 10.1109/SFCS.1997.646113
Regular:

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... View More

Advertisement