More Complicated Questions About Maxima and Minima, and Some Closures of NP

@article{Wagner1987MoreCQ,
  title={More Complicated Questions About Maxima and Minima, and Some Closures of NP},
  author={Klaus W. Wagner},
  journal={Theor. Comput. Sci.},
  year={1987},
  volume={51},
  pages={53-80}
}
  • K. Wagner
  • Published 1987
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
Abstract Starting from NP -complete problems defined by questions of the kind ‘max…⩾ m ?’ and ‘min…⩽ m ?’ we consider problems defined by more complicated questions about these maxima and minima, as for example ‘max…= m ?’. ‘min…ϵ M ?’ and ‘is max… odd?’. This continues a work started by Papadimitriou and Yannakakis (1982). It is shown that these and other problems are complete in certain subclasses of the Boolean closure of NP and other classes in the interesting area below the class Δ p 2 of… Expand
Descriptive complexity of optimization and counting problems
This thesis is about the descriptive complexity of two function classes, namely, NP optimization problems and #P counting problems. It is divided into two parts. In Part I we investigate NPExpand
A novel characterization of the complexity class ϴPk based on counting and comparison
TLDR
It is shown that problems in Θ k P are also those whose solution involves deciding, for two given sets A and B of instances of two Σ k − 1 P -complete problems, whether the number of “yes”-instances in A is greater than those in B, and a novel sufficient condition is provided based on this new characterization of this class, which provides a novel necessary condition for Θk P -hardness. Expand
NP trees and Carnap's modal logic
TLDR
This paper studies problems and complexity classes definable by interdependent queries to an oracle in NP, and shows that the following problems are complete: validity-checking of formulas in Carnap's modal logic, checking whether a formula is almost surely valid over finite structures in modal logics K, T, and S4, and checkingWhether a formula belongs to the stable set of beliefs generated by a propositional theory. Expand
The Minimum Equivalent DNF Problem and Shortest Implicants
  • C. Umans
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2001
We prove that the Minimum Equivalent DNF problem is ?P2-complete, resolving a conjecture due to Stockmeyer. We also consider the complexity and approximability of a related optimization problem inExpand
Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP
TLDR
This work completely solves all the questions left open by Bodlaender et al. and proves that for each rational r ⩾ 1, S r is complete for P ∥ NP, the class of sets solvable via parallel access to NP. Expand
Nondeterministic Turing Machines with Modified Acceptance
TLDR
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. Expand
The minimization problem for Boolean formulas
TLDR
Much better lower bounds are proved: hardness for parallel access to NP for those cases in which coNP was the best previously known lower bound, and coNP-hardness for the case in which no lower bound was previously known. Expand
The Operators min and max on the Polynomial Hierarchy
TLDR
This work defines a general maximization operator max and a general minimization operator min for complexity classes and shows that there are other interesting optimization classes beside OptP and is able to characterize the polynomial hierarchy uniformly by three operators. Expand
The Operators min and max on the Polynomial Hierarchy
TLDR
It turns out that a general max and a general min operator for complexity classes yield a refinement of Krentel's hierarchy of optimization functions, and it is proved that this refinement is strict unless the polynomial hierarchy collapses and show that the refinement is useful to exactly classify optimization functions. Expand
On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case
TLDR
Most of the results are also true for highly recursive graphs, though there are some interesting differences when queries to K are allowed for free in the computation of a recursive chromatic number. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 12 REFERENCES
Some Simplified NP-Complete Graph Problems
TLDR
This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete. Expand
On omega-Regular Sets
  • K. Wagner
  • Computer Science, Mathematics
  • Inf. Control.
  • 1979
TLDR
It turns out that further natural subclasses of the class of ω-regular sets coincide or are at least comparable to each other in terms of structural complexity, topological difficulty, and m-reducibility with finite automata. Expand
The Boolean Hierarchy: Hardware over NP
TLDR
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
On the Boolean closure of NP
TLDR
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
The Polynomial-Time Hierarchy
  • L. Stockmeyer
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1976
TLDR
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
Graph Minimal Uncolorability is D^P-Complete
TLDR
It is shown that minimal-3-uncolorability is D-p-complete, for all fixed $k \geq 3$, and can be modified by using ``sensitive'' gadgets to resolve the planar case, bounded vertex degree case and their combination. Expand
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 someExpand
A Comparison of Polynomial Time Reducibilities
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 introducingExpand
The complexity of facets resolved
Abstract We show that recognizing the facets of the traveling salesman problem polytope is Dp-complete.
...
1
2
...