Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
From MaRDI portal
Publication:4739905
DOI10.1016/S0019-9958(82)80084-3zbMath0504.03022MaRDI QIDQ4739905
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
03D15: Complexity of computation (including implicit computational complexity)
Related Items
On sets bounded truth-table reducible to $P$-selective sets, The communication complexity of enumeration, elimination, and selection, Some results on selectivity and self-reducibility, P-selectivity: Intersections and indices, On sets polynomially enumerable by iteration, On the size of classes with weak membership properties, Some connections between bounded query classes and non-uniform complexity., A note on bi-immunity and \(p\)-closeness of \(p\)-cheatable sets in \(P\)/poly