Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Making Nondeterminism Unambiguous Klaus Reinhardt
 

Summary: Making Nondeterminism Unambiguous
Klaus Reinhardt
Wilhelm-Schickard Institut fšur Informatik
Universitšat Tšubingen
Sand 13, D-72076 Tšubingen, Germany
e-mail: reinhard@informatik.uni-tuebingen.de
Eric Allender
Department of Computer Science, Rutgers University
Piscataway, NJ 08855-1179,USA
e-mail: allender@cs.rutgers.edu
March 31, 1999
Abstract
We show that in the context of nonuniform complexity, nondeterministic log-
arithmic 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: Nondeterministic space, Unambiguous computation, NLOG,

  

Source: Allender, Eric - Department of Computer Science, Rutgers University
Reinhardt, Klaus - Wilhelm-Schickard-Institut für Informatik, Universität Tübingen

 

Collections: Computer Technologies and Information Sciences