Polynomial Time Enumeration Reducibility
- 1 November 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 7 (4) , 440-457
- https://doi.org/10.1137/0207035
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Arithmetical Reducibilities IMathematical Logic Quarterly, 1971
- Note on degrees of partial functionsProceedings of the American Mathematical Society, 1961