Functions computable with nonadaptive queries to NP
From MaRDI portal
Publication:1384712
DOI10.1007/s002240000079zbMath0893.68069OpenAlexW2162185625MaRDI QIDQ1384712
Thomas Thierauf, Jim Kadin, Harry Buhrman
Publication date: 24 August 1998
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:289-vts-70462
Related Items (7)
Functions computable with limited access to NP ⋮ The consequences of eliminating NP solutions ⋮ Computing functions with parallel queries to NP ⋮ Universal relations and {\#}P-completeness ⋮ Weighted argument systems: basic definitions, algorithms, and complexity results ⋮ Competing provers yield improved Karp-Lipton collapse results ⋮ The computational complexity of ideal semantics
This page was built for publication: Functions computable with nonadaptive queries to NP
