More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Introduction to the General Theory of Algorithms
An Introduction to the General Theory of Algorithms
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
Information and Computation
| Hi-index | 0.01 |
In this paper we present an approach for proving Θ2p- completeness. There are several papers in which different problems of logic, of combinatorics, and of approximation are stated to be complete for parallel access to NP, i.e. Θ2p-complete. There is a special acceptance concept for nondeterministic Turing machines which allows a characterization of Θ2p as a polynomial-time bounded class. This characterization is the starting point of this paper. It makes a master reduction from that type of Turing machines to suitable boolean formula problems possible. From the reductions we deduce a couple of conditions that are sufficient for proving Θ2p-hardness. These new conditions are applicable in a canonical way. Thus we are able to do the following: (i) we can prove the Θ2p-completeness for different combinatorial problems (e.g. max-card-clique compare) as well as for optimization problems (e.g. the Kemeny voting scheme), (ii) we can simplify known proofs for Θ2p-completeness (e.g. for the Dodgson voting scheme), and (iii) we can transfer this technique for proving Δ2p-completeness (e.g. TSPcompare).