Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Co-NP-complete

Known as: CoNP-complete 
In complexity theory, computational problems that are co-NP-complete are those that are the hardest problems in co-NP, in the sense that any problem… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Data is increasingly being bought and sold online, and Web-based marketplace services have emerged to facilitate these activities… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
A vertically integrated 2D numerical model was developed for the simulation of major tidal constituents (M2, S2, N2, K1 and O1… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions… Expand
  • table 1
  • table 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Data complexity of reasoning in description logics (DLs) estimates the performance of reasoning algorithms measured in the size… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
2003
2003
We present a graph-based data model called GDM where database instances and database schemas are described by certain types of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
The satisfiability problem for the logic FP(L) (fuzzy probability logic over Lukasiewicz logic) is shown to be NP-complete… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
  • S. Micali
  • SIAM J. Comput.
  • 2000
  • Corpus ID: 15168020
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation… Expand
Is this relevant?
1991
1991
F.P. Preparata et al. (1967) introduced a graph-theoretical model for fault diagnosis called the PMC model. The question of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Braids can be represented as two-dimensional diagrams showing the crossings of strings or as words over the generators of a braid… Expand
  • figure 1
Is this relevant?