On gamma-reducibility versus polynomial time many-one reducibility
From MaRDI portal
Publication:1149766
DOI10.1016/0304-3975(81)90007-4zbMath0454.68031MaRDI QIDQ1149766
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90007-4
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Nondeterministic functions and the existence of optimal proof systems, Comparing reductions to NP-complete sets, Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems, Strong nondeterministic polynomial-time reducibilities, One-way functions and circuit complexity, On sparse hard sets for counting classes
Cites Work