A comparison of polynomial time reducibilities
Open Access
- 31 December 1975
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1 (2), 103-123
- https://doi.org/10.1016/0304-3975(75)90016-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944