Making nondeterminism unambiguous

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1997, Pages 244-253

  Reinhardt, Klaus ^a   Allender, Eric ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

NONDETERMINISTIC LOGARITHMIC SPACE;

CONTEXT FREE LANGUAGES;

EID: 0031381593     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (0)