Bounded queries, approximations, and the Boolean hierarchy

Authors:
Richard Chang
Affiliations:
Univ. of Maryland Baltimore County, Baltimore
Venue:
Information and Computation
Year:
2001

Citing 23
Cited 4

Quantitative relativizations of complexity classes

SIAM Journal on Computing
Probability one separation of the Boolean hierarchy

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
The complexity of optimization problems

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
The Boolean hierarchy I: structural properties

SIAM Journal on Computing
The polynomial time hierarchy collapses if the Boolean hierarchy collapses

SIAM Journal on Computing
The Boolean hierarchy II: applications

SIAM Journal on Computing
Bounded query classes

SIAM Journal on Computing
Bounded queries to SAT and the Boolean hierarchy

Theoretical Computer Science
Approximating clique is almost NP-complete (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Complexity-Restricted Advice Functions

SIAM Journal on Computing
Derandomized graph products

Computational Complexity
Probabilistic checking of proofs and hardness of approximation problems

Probabilistic checking of proofs and hardness of approximation problems
On the query complexity of clique size and maximum satisfiability

Journal of Computer and System Sciences
On Bounded Queries and Approximation

SIAM Journal on Computing
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection

SIAM Journal on Computing
Structure in Approximation Classes (Extended Abstract)

COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
On Approximation Scheme Preserving Reducability and Its Applications

Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Two Queries

COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Commutative Queries

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A Downward Translation in the Polynomial Hierarchy

A Downward Translation in the Polynomial Hierarchy

One Bit of Advice

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Boolean Lowness and Boolean Highness

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Competing provers yield improved Karp-Lipton collapse results

Information and Computation
Competing provers yield improved Karp-Lipton collapse results

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates nondeterministic bounded query classes in relation to the complexity of NP-hard approximation problems and the Boolean Hierarchy. Nondeterministic bounded query classes turn out to be rather suitable for describing the complexity of NP-hard approximation problems. The results in this paper take advantage of this machine-based.