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.
2013
2013
Point Line Cover
The input to the NP-hard point line cover problem (PLC) consists of a set P of n points on the plane and a positive integer k… 
2011
2011
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset… 
2006
2006
A new approach to camera hand-off without camera calibration for the general scene with non-planar ground
For robust continuous tracking across multiple views for the wide surveillance environment it is helpful to know the geometric… 
Highly Cited
2004
Highly Cited
2004
Soil Surface Property and Soybean Yield Response to Corn Stover Grazing
Farmer concern that compaction and/or surface roughness caused by winter grazing of corn (Zea mays L.) crop residues may reduce… 
2004
2004
Replica Selection on Co-allocation Data Grids
Data Grid supports data-intensive applications in a large scale grid environment. It makes use of storage systems as distributed… 
2003
2003
Investigation of a steady-state cylindrical magnetron discharge for plasma immersion treatment
Ion current distribution in a system with crossed magnetic and electrical fields for plasma immersion ion implantation has been… 
2003
2003
Cultural and Ethical Challenges in Cross-National Research: Reflections on a European Union Study on Child & Youth Migration
The increasing development of pan-national and supra-national institutions and ‘states’ such as the European Union implies that… 
1993
1993
Relativized limitations of left set technique and closure classes of sparse sets
  • Sanjeev Saluja
  • [] Proceedings of the Eigth Annual Structure in…
  • 1993
  • Corpus ID: 11603643
A number of theorems are proved by introducing the notion of k-families of sets of strings, and an algorithm which outputs the… 
Highly Cited
1985
Highly Cited
1985
An investigation of the Co:MgF2laser system
The Co:MgF2laser, tunable over the range from 1.5 to 2.3 μm, has been investigated under a variety of operating conditions… 
Highly Cited
1983
Highly Cited
1983
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
  • Y. Yesha
  • SIAM journal on computing (Print)
  • 1983
  • Corpus ID: 36893080
Let $\Sigma $ be a finite alphabet. A set $S \subset \Sigma ^ * $ is called sparse if the number of members of S having length at… 
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)