Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,101,575 papers from all fields of science
Search
Sign In
Create Free Account
Co-NP
Known as:
Co np
, CoNP
, NP
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
AKS primality test
Alternating Turing machine
Circuit Value Problem
Co-NP-complete
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
A Comparative Analysis of Adaptive Digital Predistortion Algorithms for Multiple Antenna Transmitters
P. Suryasarman
,
A. Springer
IEEE Transactions on Circuits and Systems Part 1…
2015
Corpus ID: 25292301
This paper presents a comparative study of adaptive algorithms for digital predistortion (DPD) in multiple antenna transmitters…
Expand
2013
2013
Point Line Cover
Stefan Kratsch
,
Geevarghese Philip
,
Saurabh Ray
ACM Trans. Algorithms
2013
Corpus ID: 7625005
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…
Expand
2006
2006
A new approach to camera hand-off without camera calibration for the general scene with non-planar ground
Younggwan Jo
,
Joonhee Han
VSSN '06
2006
Corpus ID: 18675869
For robust continuous tracking across multiple views for the wide surveillance environment it is helpful to know the geometric…
Expand
Highly Cited
2004
Highly Cited
2004
Soil Surface Property and Soybean Yield Response to Corn Stover Grazing
Justin Clark
,
J. Russell
,
D. Karlen
,
P. Singleton
,
W. D. Busby
,
B. Peterson
2004
Corpus ID: 34454775
Farmer concern that compaction and/or surface roughness caused by winter grazing of corn (Zea mays L.) crop residues may reduce…
Expand
2004
2004
Replica Selection on Co-allocation Data Grids
R. Chang
,
Chih-Min Wang
,
Po-Hung Chen
International Symposium on Image and Signal…
2004
Corpus ID: 14024757
Data Grid supports data-intensive applications in a large scale grid environment. It makes use of storage systems as distributed…
Expand
2003
2003
Investigation of a steady-state cylindrical magnetron discharge for plasma immersion treatment
I. Levchenko
,
M. Romanov
,
M. Keidar
2003
Corpus ID: 53457439
Ion current distribution in a system with crossed magnetic and electrical fields for plasma immersion ion implantation has been…
Expand
2003
2003
Cultural and Ethical Challenges in Cross-National Research: Reflections on a European Union Study on Child & Youth Migration
Mark Redmond
2003
Corpus ID: 53076009
The increasing development of pan-national and supra-national institutions and ‘states’ such as the European Union implies that…
Expand
1997
1997
Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae
Marco Cadoli
,
A. Giovanardi
,
M. Schaerf
International Conference of the Italian…
1997
Corpus ID: 707289
Although Knowledge Representation is full of reasoning problems that have been formally proved to be both NP-hard and coNP-hard…
Expand
1984
1984
Algebraic Structures with Hard Equivalence and Minimization Problems
P. A. Bloniarz
,
H. Hunt
,
D. Rosenkrantz
JACM
1984
Corpus ID: 665033
On considere la relation entre la forme dans laquelle un probleme algebrique est pose et la complexite de resoudre le probleme…
Expand
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…
Expand
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)
ACCEPT & CONTINUE