Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,257,086 papers from all fields of science
Search
Sign In
Create Free Account
Co-NP-complete
Known as:
CoNP-complete
In complexity theory, computational problems that are co-NP-complete are those that are the hardest problems in co-NP, in the sense that any problem…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Automated theorem proving
Boolean satisfiability problem
Co-NP
Complement (complexity)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Mind the Independence Gap
T. Ekim
,
Didem Gözüpek
,
Ademir Hujdurović
,
Martin Milanič
Discrete Mathematics
2018
Corpus ID: 54719636
2013
2013
Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
Zhibin Deng
,
S. Fang
,
Qingwei Jin
,
W. Xing
European Journal of Operational Research
2013
Corpus ID: 40436961
2008
2008
Bipartite matching extendable graphs
Xiumei Wang
,
Zhenkun Zhang
,
Yixun Lin
Discrete Mathematics
2008
Corpus ID: 17328763
2005
2005
On scheduling complex dags for Internet-based computing
G. Malewicz
,
A. Rosenberg
,
Matthew Yurkewych
IEEE International Parallel and Distributed…
2005
Corpus ID: 17719501
Conceptual tools are developed to aid in crafting a theory of scheduling complex computation-dags for Internet-based computing…
Expand
2003
2003
The maximum deviation just-intime scheduling problem
N. Braunera
,
Y. Cramab
2003
Corpus ID: 53312802
This note revisits the maximum deviation just-in-time (MDJIT) scheduling problem previously investigated by Steiner and Yeomans…
Expand
2000
2000
Complexity of weak bisimilarity and regularity for BPA and BPP
Jiri Srba
Mathematical Structures in Computer Science
2000
Corpus ID: 2384243
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP…
Expand
2000
2000
Co-NP-completeness of some matrix classification problems
P. Tseng
Mathematical programming
2000
Corpus ID: 17779431
Abstract.The classes of P-, P0-, R0-, semimonotone, strictly semimonotone, column sufficient, and nondegenerate matrices play…
Expand
2000
2000
Democratic Consensus and the Local Majority Rule
Nabil H. Mustafa
,
A. Pekec
2000
Corpus ID: 17628581
In this paper we study a rather generic communication/ coordination/ computation problem: in a finite network of agents, each…
Expand
1996
1996
On 4-connected Claw-free Well-covered Graphs
B. Hartnell
,
M. Plummer
Discrete Applied Mathematics
1996
Corpus ID: 45967809
1991
1991
Sequential Diagnosability is Co-NP Complete
V. Raghavan
,
A. Tripathi
IEEE Trans. Computers
1991
Corpus ID: 28142336
F.P. Preparata et al. (1967) introduced a graph-theoretical model for fault diagnosis called the PMC model. The question of…
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