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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
This is a summary of the proof by G.E. Coxson [1] that P-matrix recognition is co-NP-complete. The result follows by a reduction… (More)
Is this relevant?
2003
2003
Electron backscattered diffraction has been used to determine the orientation of WC crystals in a WC-Co composite and atomic… (More)
  • figure 1
  • figure 2
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2000
2000
The classes of P-, P 0-, R 0-, semimonotone, strictly semimonotone, column suucient, and nondegenerate matrices play important… (More)
Is this relevant?
1991
1991
Algorithmic problems in braid groups have received much attention since [À1]. An algorithm for the word problem was given… (More)
  • figure 1
Is this relevant?
1991
1991
 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1990
1990
We defîne the rank of a finite set of words X as the integer: r(X) = min{\Y\:X£Y*\. X is said elementary iff r{X) = \X\ oiherwise… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all… (More)
Is this relevant?
1990
1990
Rigid E-unification is a restricted kind of unification module equational theories, or E-unification, that arises naturally in… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Computational tractability has been a major concern in the area of termi-nological knowledge representation and reasoning… (More)
Is this relevant?