Polynomial Time Enumeration Reducibility
From MaRDI portal
Publication:4167585
DOI10.1137/0207035zbMath0386.68055MaRDI QIDQ4167585
Publication date: 1978
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0207035
DB lookup for MSC labels failed
Related Items
On the complexity of graph reconstruction, On sets polynomially enumerable by iteration, Logarithmic advice classes, A taxonomy of complexity classes of functions, Scalability and the isomorphism problem, Collapsing degrees via strong computation, A survey of one-way functions in complexity theory