On the Boolean closure of NP

@inproceedings{Wechsung1985OnTB,
  title={On the Boolean closure of NP},
  author={Gerd Wechsung},
  booktitle={International Symposium on Fundamentals of Computation Theory},
  year={1985}
}
  • G. Wechsung
  • Published in
    International Symposium on…
    9 September 1985
  • Computer Science
By endowing usual nondeterministic Turing machines with new modes of acceptance we introduce new machines whose computational power is bounded by that of alternating Turing machines making only one alternation. The polynomial time classes of these machines are exactly the levels of the Boolean closure of NP which can be defined in a natural way. For all these classes natural problems can be found which are proved to be ≤ m P -complete in these classes. 

Complexity of Topological Properties of Regular omega-Languages

The complexity of topological properties of regular ω-languages is determined by showing that they are typically NL-complete (PSPACE-complete) for the deterministic Muller, Mostowski and Buchi automata.

Complexity of Topological Properties of Regular ω-Languages

The complexity of topological properties of regular ω-languages is determined by showing that they are typically NL-complete (PSPACEcomplete) for the deterministic Muller, Mostowski and Büchi automata.

Modulo Information from Nonadaptive Queries to NP

The classes of languages accepted by nondeterministic polynomial-time Turing machines that have restricted access to an NP oracle coincide with an appropriate level of the Boolean hierarchy when m is even or k 2m, and the results are generalized to the case when the NP machines are replaced by Turing machines accepting languages of the l th level of.

Nondeterministic Turing Machines with Modified Acceptance

In this paper an extremely fine hierarchy within BC(NP) is proposed, characterized by nondeter-ministic polynomial time Turing machines with suitably modified acceptance notions.

On the Complexity of Automatic Complexity

It is proved that the problem of determining whether A(E) equals the number |E| of equivalence classes of E is NP-complete, and the complexity of infinite subsets of L is characterized by showing that they can be co-context-free but not context-free.

Bounded Queries to SAT and the Boolean Hierarchy

  • R. Beigel
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1991

Equivalence Problems for Circuits over Sets of Natural Numbers

This work gives a systematic characterization of the complexity of equivalence problems over sets of natural numbers and provides an improved upper bound for the case of {∪,∩,−,+,×}-circuits.

Query-limited reducibilities

The Nonspeedup Theorem is proved, which states that 2$\sp{n}$ parallel queries to any fixed nonrecursive oracle cannot be answered by an algorithm that makes only n queries toAny oracle whatsoever.

Characterizations of some complexity classes between Θ p 2 and ∆ p 2

It is shown that these classes are equal to classes ACk−1(NP) and it is proved that they are also equivalent to some classes defined in the Extended Boolean hierarchy.

Characterizations of Some Complexity Classes Between Theta^p_2 and Delta^p_2

It is shown that classes P NP [O(log k n)] are equal to classes ACk−1(NP), and it is proved that they are also equivalent to some classes defined in the Extended Boolean hierarchy.
...

References

SHOWING 1-5 OF 5 REFERENCES

On omega-Regular Sets

The complexity of theorem-proving procedures

  • S. Cook
  • Mathematics, Computer Science
    STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a

Theory of Recursive Functions and Effective Computability

Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular and generalizations of recursion theory.

Computers and Intractability: A Guide to the Theory of NP-Completeness

It is proved here that the number ofrules in any irredundant Horn knowledge base involving n propositional variables is at most n 0 1 times the minimum possible number of rules.

The complexity of facets (and some facets of complexity)

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