Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
coNP-completeness
Description:
A classification in computational complexity for decision problems whose complements are in NP and to which every coNP problem reduces.
Related topics:
Advanced Graph Theory Research (14%),
Logic, Reasoning, and Knowledge (11%),
Complexity and Algorithms in Graphs (10%),
semigroups and automata theory (9%)
OpenAlex ID:
keywords/conp-completeness
Semantics and complexity of SPARQL
2009
·
Jorge Pérez
, Marcelo Arenas
, et al.
·
ACM Transactions on Database Systems
·
1,402
Eigenvalues and expanders
1986
·
Noga Alon
·
COMBINATORICA
·
1,351
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
1990
·
Sanjoy K. Baruah
, Louis E. Rosier
, et al.
·
Real-Time Systems
·
651
Conditional functional dependencies for capturing data inconsistencies
2008
·
Wenfei Fan
, Floris Geerts
, et al.
·
ACM Transactions on Database Systems
·
514
Identifying the Minimal Transversals of a Hypergraph and Related Problems
1995
·
Thomas Eiter
, Georg Gottlob
·
SIAM Journal on Computing
·
489
Resolution for Quantified Boolean Formulas
1995
·
H.K. Buning
, M. Karpinski
, et al.
·
Information and Computation
·
396
The Algorithmic Aspects of the Regularity Lemma
1994
·
N. Alon
, R.A. Duke
, et al.
·
Journal of Algorithms
·
343
Towards Formal Analysis of Artifact-Centric Business Process Models
2007
·
Kamal Bhattacharya
, Cagdas Gerede
, et al.
·
Springer eBooks
·
326
Containment and equivalence for a fragment of XPath
2004
·
Gerome Miklau
, Dan Suciu
·
Journal of the ACM
·
318
Terminological reasoning is inherently intractable
1990
·
Bernhard Nebel
·
Artificial Intelligence
·
287
Containment and equivalence for an XPath fragment
2002
·
Gerome Miklau
, Dan Suciu
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
283
On the representation and querying of sets of possible worlds
1991
·
Serge Abiteboul
, Paris Kanellakis
, et al.
·
Theoretical Computer Science
·
269
Model Checking of Message Sequence Charts
1999
·
Rajeev Alur
, Mihalis Yannakakis
·
Lecture notes in computer science
·
268
Repair checking in inconsistent databases: algorithms and complexity
2009
·
Foto N. Afrati
, Phokion G. Kolaitis
·
International Conference on Database Theory
·
190
PDF
On XML integrity constraints in the presence of DTDs
2002
·
Wenfei Fan
, Leonid Libkin
·
Journal of the ACM
·
188
On the computational complexity of membership problems for the completely positive cone and its dual
2013
·
Peter J. C. Dickinson
, Luuk Gijben
·
Computational Optimization and Applications
·
182
Realizability and verification of MSC graphs
2004
·
Rajeev Alur
, Kousha Etessami
, et al.
·
Theoretical Computer Science
·
181
PDF
On the representation and querying of sets of possible worlds
1987
·
Serge Abiteboul
, Paris Kanellakis
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
170
A Notion of Robustness in Complex Networks
2015
·
Haotian Zhang
, Elaheh Fata
, et al.
·
IEEE Transactions on Control of Network Systems
·
169
Containment for XPath Fragments under DTD Constraints
2002
·
Peter T. Wood
·
Lecture notes in computer science
·
163
Functional Dependencies for Graphs
2016
·
Wenfei Fan
, Yinghui Wu
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
157
PDF
Generalized Mean-payoff and Energy Games
2010
·
Chatterjee, Krishnendu
, Doyen, Laurent
, et al.
·
Leibniz international proceedings in informatics
·
155
PDF
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
2008
·
Magdalena Ortiz
, Diego Calvanese
, et al.
·
Journal of Automated Reasoning
·
150
On mutually exclusive roles and separation-of-duty
2007
·
Ninghui Li
, Mahesh V. Tripunitara
, et al.
·
ACM Transactions on Information and System Security
·
140
XML data exchange: Consistency and query answering
2008
·
Marcelo Arenas
, Leonid Libkin
·
Journal of the ACM
·
134
Show more works
View as search
Works count:
1,222
Citation count:
22,010
Year
Topic
Type