On the Boolean closure of NP

@inproceedings{Wechsung1985OnTB,
  title={On the Boolean closure of NP},
  author={G. Wechsung},
  booktitle={FCT},
  year={1985}
}
  • G. Wechsung
  • Published in FCT 1985
  • Mathematics, 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
Modulo Information from Nonadaptive Queries to NP
Nondeterministic Turing Machines with Modified Acceptance
On the Complexity of Automatic Complexity
  • B. Kjos-Hanssen
  • Mathematics, Computer Science
  • Theory of Computing Systems
  • 2017
On Logical Descriptions of Some Concepts in Structural Complexity Theory
Bounded Queries to SAT and the Boolean Hierarchy
  • R. Beigel
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1991
Query-limited reducibilities
...
1
2
3
4
5
...

References

SHOWING 1-5 OF 5 REFERENCES
On omega-Regular Sets
  • K. Wagner
  • Computer Science, Mathematics
  • Inf. Control.
  • 1979
The complexity of theorem-proving procedures
  • S. Cook
  • Computer Science, Mathematics
  • STOC
  • 1971
The complexity of facets (and some facets of complexity)