Polynomial-time isomorphism of 1-L-complete sets

DOI10.1006/jcss.1996.0057zbMath0859.68028OpenAlexW2024595392MaRDI QIDQ1816724

Somenath Biswas, Manindra Agrawal

Publication date: 27 November 1996

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/839cf36789e9b4ba90a222cd9ac25b9d934ef92f

zbMATH Keywords

complexity classfinite-crossing machines

Mathematics Subject Classification ID

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

Related Items (2)

NL-printable sets and nondeterministic Kolmogorov complexity ⋮ Investigations Concerning the Structure of Complete Sets

This page was built for publication: Polynomial-time isomorphism of 1-L-complete sets