# The Difference and Truth-Table Hierarchies for NP

@article{Kbler1987TheDA, title={The Difference and Truth-Table Hierarchies for NP}, author={Johannes K{\"o}bler and Uwe Sch{\"o}ning and Klaus W. Wagner}, journal={RAIRO Theor. Informatics Appl.}, year={1987}, volume={21}, pages={419-435} }

Definition de deux hierarchies des classes de complexite. Localisation de la hierarchie de differences et de la hierarchie du tableau de verite pour NP. Exemples d'ensembles complets dans les deux hierarchies et examen de leurs correlations

#### Topics from this paper

#### 138 Citations

Fine Hierarchies and Boolean Terms

- Mathematics, Computer Science
- J. Symb. Log.
- 1995

This work gives new short descriptions of fine hierarchies in recursion theory, descriptive set theory, logic and complexity theory, and shows that collections of sets of values of Boolean terms are almost well ordered by inclusion. Expand

Bounded query classes and the difference hierarchy

- Mathematics, Computer Science
- Arch. Math. Log.
- 1989

A hierarchy of sets that are reducible toA based on bounding the number of queries toA that an oracle machine can make is defined, i.e. sets in a logarithmic way. Expand

Refining the polynomial hierarchy

- Mathematics
- 1999

By a result of Kadin, the difference hierarchy over NP does not collapse if the polynomial hierarchy does not. We extend this result to a natural refinement of the polynomial hierarchy. The… Expand

A survey on difference hierarchies of regular languages

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2018

This survey paper gives decidability results on the difference hierarchies based on shuffle ideals, strongly cyclic regular languages and the polynomial closure of group languages. Expand

Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies

- Computer Science, Mathematics
- RAIRO Theor. Informatics Appl.
- 2002

It is shown that some natural refinements of the Straubing and Brzozowski hierarchies correspond to the Boolean hierarchy and the plus-hierarchy step by step to similar refinement of the polynomial-time hierarchy. Expand

Much ado about functions

- Computer Science, Mathematics
- Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)
- 1996

This paper surveys basic results on complexity classes of partial multivalued functions. We stress basic inclusion relations, interesting hierarchies, and results that demonstrate that hierarchies… Expand

The domatic number problem: Boolean hierarchy completeness and exact exponential time algorithms

- Computer Science, Mathematics
- 2006

Das Domatic Number Problem wird in verschiedenen Variationen aus komplexitatstheoretischer Sicht betrachtet anderswo die hoheren Stufen der Booleschen Hierarchie uber NP erzielt. Expand

Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies

- Mathematics, Computer Science
- FCT
- 2001

We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynomial-time hierarchy.… Expand

The Boolean Hierarchy of NP-Partitions

- Mathematics, Computer Science
- STACS
- 2000

The Embedding Conjecture is established which enables us to get a complete idea of the structure of the boolean hierarchy of k-partitions over NP for k ≥ 3. Expand

Fine hierarchies and m-reducibilities in theoretical computer science

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2008

This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science, to identify the unifying notions, techniques and ideas. Expand

#### References

SHOWING 1-10 OF 21 REFERENCES

The Boolean Hierarchy: Hardware over NP

- Mathematics, Computer Science
- Computational Complexity Conference
- 1986

The structure of the boolean hierarchy and its relations with more common classes is emphasized: separation and immunity results, complete languages, upward separations, connections to sparse oracles for NP, and structural asymmetries between complementary classes. Expand

The complexity of facets (and some facets of complexity)

- Mathematics, Computer Science
- STOC '82
- 1982

Many important combinatorial optimization problems, including the traveling salesman problem (TSP), the clique problem and many others, call for the optimization of a linear functional over some… Expand

A Comparison of Polynomial Time Reducibilities

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1975

Abstract Various forms of polynomial time reducibility are compared. Among the forms examined are many-one, bounded truth table, truth table and Turing reducibility. The effect of introducing… Expand

On the Unique Satisfiability Problem

- Mathematics, Computer Science
- Inf. Control.
- 1982

An oracle is constructed relative to which UNIQUE SAT is not complete for DIF ~, and another oracle relative towhich UNIQue SAT is complete forDIF e, whereas NP v ~ co - NP is co- NP. Expand

On the complexity of unique solutions

- Mathematics
- FOCS 1982
- 1982

We show that the problem of deciding whether an instance of the traveling salesman problem has a uniquely optimal solution is complete for Δ2P.

The Polynomial-Time Hierarchy

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1976

The problem of deciding validity in the theory of equality is shown to be complete in polynomial-space, and close upper and lower bounds on the space complexity of this problem are established. Expand

On the Boolean closure of NP

- Mathematics, Computer Science
- FCT
- 1985

New machines whose computational power is bounded by that of alternating Turing machines making only one alternation are introduced whose polynomial time classes are exactly the levels of the Boolean closure of NP which can be defined in a natural way. Expand

Succinct representation of graphs

- Mathematics
- 1982

This work presents a different approach to the continuing work done in the development of efficient algorithms for the solution of graph problems. While until now the main effort has been directed… Expand

Succinct Representations of Graphs

- Mathematics, Computer Science
- Inf. Control.
- 1983

The main result is characterizing a large class of graph properties for which the respective “succinct problem” is NP-hard, and shows that the succinct versions of polynomially equivalent problems may not be polynomial equivalent. Expand

Optimization Problems and the Polynomial Hierarchy

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1981

Abstract It is demonstrated that such problems as the symmetric Travelling Salesman Problem, Chromatic Number Problem, Maximal Clique Problem and a Knapsack Packing Problem are in the ΔP2 level of PH… Expand