Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
New Limits to Classical and Quantum Instance Compression
Given an instance of a hard decision problem, a limited goal is to compress that instance into a smaller, equivalent instance of… 
Highly Cited
2010
Highly Cited
2010
Generalized Mean-payoff and Energy Games
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric… 
Highly Cited
2007
Highly Cited
2007
Reconstructing visual landscapes
Abstract The following paper reiterates the importance of studying past visibility patterns within the context of landscape… 
Review
2005
Review
2005
Molecular beam experiments on model catalysts
Highly Cited
2005
Highly Cited
2005
Data Complexity of Reasoning in Very Expressive Description Logics
Data complexity of reasoning in description logics (DLs) estimates the performance of reasoning algorithms measured in the size… 
Highly Cited
2004
Highly Cited
2004
Urbanised territories as a specific component of the Global Carbon Cycle
Highly Cited
1999
Highly Cited
1999
Optical waveguide isolator based on nonreciprocal loss/gain of amplifier covered by ferromagnetic layer
The effect of nonreciprocal loss/gain of a waveguide optical amplifier covered by an absorbing magnetooptic layer was studied for… 
Highly Cited
1997
Highly Cited
1997
Strong Duality for Semidefinite Programming
It is well known that the duality theory for linear programming (LP) is powerful and elegant and lies behind algorithms such as… 
Highly Cited
1983
Highly Cited
1983
Computational complexity and the classification of finite simple groups
We address the graph isomorphism problem and related fundamental complexity problems of computational group theory. The main… 
Highly Cited
1980
Highly Cited
1980
3-D transformations of images in scanline order
Currerntly texture mapping onto projections of 3-D surfaces is time consuming and subject to considerable aliasing errors… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)