Honest Polynomial Time Reducibilities and the P = ? NP Problem

Klaus Ambos-Spies. Honest Polynomial Time Reducibilities and the P = ? NP Problem. J. Comput. Syst. Sci., 39(3):250-281, 1989.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.