The strong exponential hierarchy collapses
Reads0
Chats0
TLDR
It is shown that the strong exponential hierarchy collapses to P NE, its Δ 2 level, using the use of partial census information and the exploitation of nondeterminism.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1989-12-01 and is currently open access. It has received 164 citations till now. The article focuses on the topics: Exponential hierarchy & Hierarchy (mathematics).read more
Citations
More filters
Book ChapterDOI
A catalog of complexity classes
TL;DR: This chapter discusses the concepts needed for defining the complexity classes, a set of problems of related resource-based complexity that can be solved by an abstract machine M using O(f(n) of resource R, where n is the size of the input.
Journal ArticleDOI
Combining answer set programming with description logics for the Semantic Web
TL;DR: In this article, a combination of logic programming under the answer set semantics with the description logics SHIF(D) and SHOIN(D), which underly the Web ontology languages OWL Lite and OWL DL, is proposed.
BookDOI
Handbook of Computational Social Choice
TL;DR: This handbook, written by thirty-six prominent members of the computational social choice community, covers the field comprehensively and offers detailed introductions to each of the field's major themes.
Journal ArticleDOI
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
TL;DR: It follows that determining the winner in Carroll's elections is not NP-complete unless the polynomial hierarchy collapses, and the stronger lower bound and upper bound are provided that matches the lower bound.
Journal ArticleDOI
The complexity of Kemeny elections
TL;DR: A stronger lower bound and an upper bound matching the lower bound are provided that determining the winner in Kemeny's system is complete for P||NP, the class of sets solvable via parallel access to NP.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
The polynomial-time hierarchy☆
TL;DR: 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.
Journal ArticleDOI