On Bounded Queries and Approximation
From MaRDI portal
Publication:4337440
Recommendations
- Bounded queries, approximations, and the Boolean hierarchy
- scientific article; zbMATH DE number 1405575
- Bounding queries in the analytic polynomial-time hierarchy
- On bounded query machines
- Bounded queries to arbitrary sets
- On the Structure of Bounded Queries to Arbitrary NP Sets
- Some connections between bounded query classes and non-uniform complexity.
- Some initial thoughts on bounded query computations over the reals
- Nondeterministic bounded query reducibilities
- Bounded queries in recursion theory
Cited in
(6)- scientific article; zbMATH DE number 1860650 (Why is no real title available?)
- scientific article; zbMATH DE number 1405575 (Why is no real title available?)
- scientific article; zbMATH DE number 1424049 (Why is no real title available?)
- Structure in approximation classes
- Bounded queries, approximations, and the Boolean hierarchy
- On the computational complexity of querying bounds on differences constraints
This page was built for publication: On Bounded Queries and Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337440)