scientific article; zbMATH DE number 1283991

zbMath0922.68062MaRDI QIDQ4240333

Eric W. Allender, Shiyu Zhou

Publication date: 3 May 1999

Full work available at URL: http://www.eccc.uni-trier.de/eccc/info/call.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

LogFewnondeterministic logspace computation

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

NL-printable sets and nondeterministic Kolmogorov complexity ⋮ Isolation, matching, and counting uniform and nonuniform upper bounds ⋮ NL-printable sets and Nondeterministic Kolmogorov Complexity

This page was built for publication: