# Co-NP-complete

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2007

2007

- ArXiv
- 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?

2005

2005

- Studia Logica
- 2005

Â

Is this relevant?

2003

2003

- 2003

Electron backscattered diffraction has been used to determine the orientation of WC crystals in a WC-Co composite and atomicâ€¦Â (More)

Is this relevant?

2000

2000

- Math. Program.
- 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

- J. Algorithms
- 1991

Algorithmic problems in braid groups have received much attention since [Ã€1]. An algorithm for the word problem was givenâ€¦Â (More)

Is this relevant?

1991

1990

1990

- ITA
- 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

- Real-Time Systems
- 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

- Inf. Comput.
- 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

- IWBS Report
- 1989

Computational tractability has been a major concern in the area of termi-nological knowledge representation and reasoningâ€¦Â (More)

Is this relevant?