L-Printable Sets
From MaRDI portal
Publication:4210140
DOI10.1137/S0097539796300441zbMath0915.68067MaRDI QIDQ4210140
Stephen R. Mahaney, Matthew A. Levy, Judy Goldsmith, Lance J. Fortnow
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
computational complexityrankingKolmogorov complexitysparse setscontext-free languagesregular languageslogspace\(L\)-isomorphisms
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
NL-printable sets and nondeterministic Kolmogorov complexity ⋮ NL-printable sets and Nondeterministic Kolmogorov Complexity
This page was built for publication: L-Printable Sets