On one-one polynomial time equivalence relations
- 31 December 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 38, 157-165
- https://doi.org/10.1016/0304-3975(85)90218-x
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- On sparse sets in NP–PInformation Processing Letters, 1983
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977