|
ComputingReviews.com
|
NL-printable sets and nondeterministic Kolmogorov complexity Allender E. Theoretical Computer Science355(2):127-138,2006.Type:Article |
|
|
|
Published By: Elsevier Science Publishers Ltd. |
|
|
|
|
|
|
|
|
Use your personal or institutional subscription to read the fulltext of the article.
|
|
|
|
|
|
|
|
|
|
|
|