On the Structure of Bounded Queries to Arbitrary NP Sets
From MaRDI portal
Publication:4016404
DOI10.1137/0221045zbMath0749.68034MaRDI QIDQ4016404
Publication date: 14 December 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6784
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03D20: Recursive functions and relations, subrecursive hierarchies
Related Items
Bounded queries to arbitrary sets, On the asymmetric complexity of the group-intersection problem, Some connections between bounded query classes and non-uniform complexity.