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

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… Expand
Wikipedia

Related topics

Related topics

34 relations
AKS primality testAlternating Turing machineCircuit Value ProblemCo-NP-complete
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Recent Advances of Cobalt-Based Electrocatalysts for Oxygen Electrode Reactions and Hydrogen Evolution Reaction
This review summarizes recent progress in the development of cobalt-based catalytic centers as the most potentially useful… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Semantics and complexity of SPARQL
SPARQL is the standard language for querying RDF data. In this article, we address systematically the formal study of the… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
On problems without polynomial kernels
Kernelization is a strong and widely-applied technique in parameterized complexity. A kernelization algorithm, or simply a kernel… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Infeasibility of instance compression and succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae Φ1,...,Φm each of size at most n, whether at least one of the Φi's is satisfiable… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Pushing the EL Envelope
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
1998
Highly Cited
1998
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
We show that the shortest vector problem in lattices with La norm is NP-hard for randomized reductions. Moreover we also show… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Does co-NP Have Short Interactive Proofs?
Abstract Babai (1985) and Goldwasser,Micali and Rackoff (1985) introduced two probabilistic extensions of the complexity class NP… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Eigenvalues and expanders
  • N. Alon
  • Comb.
  • 1986
    • Corpus ID: 41083612
Linear expanders have numerous applications to theoretical computer science. Here we show that a regular bipartite graph is an… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE