Co-NP

Known as: Co np, CoNP, NP 
In computational complexity theory, co-NP is a complexity class. A decision problem is a member of co-NP if and only if its complement is in the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We provide a methodology to introduce relational hypersequent calculi for a large class of many-valued logics, and a sufficient… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
Extending results of Schindler, Hamkins and Welch, we establish in the context of infinite time Turing machines that P is… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specification… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2003
2003
In 1996, Fredman and Khachiyan [J. Algorithms 21 (1996) 618–628] presented a remarkable algorithm for the problem of checking the… (More)
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?
Highly Cited
1997
Highly Cited
1997
We show that the shortest vector problem in lattices with La norm is NP-hard for randomized reductions. Moreover we also show… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential… (More)
  • figure 1
  • figure 2
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?
Highly Cited
1991
Highly Cited
1991
In this paper we demonstrate the generality and wide applicability of zero-knowledge proofs, a notion introduced by Goldwasser… (More)
Is this relevant?