Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,766 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.
2019
2019
Cartilla guía y manual de procedimientos para la opción de grado "Curso Co terminal"
González Tarazona
,
J. Alexander
2019
Corpus ID: 219163815
This guidebook presented below corresponds to the dissertation called "CO TERMINAL course", which is aimed in the first instance…
Expand
2017
2017
Verifying the Validity of a Conformant Plan is co-NP-Complete
Alban Grastien
,
Enrico Scala
2017
Corpus ID: 64836852
The purpose of this document is to show the complexity of verifying the validity of a deterministic conformant plan. We…
Expand
2014
2014
Szemer´edi’s Regularity Lemma
Lalla Mouatadid
2014
Corpus ID: 263337334
Szemer´edi’s Regularity Lemma is an important result in extremal graph theory. Roughly speaking, the lemma states that every…
Expand
2009
2009
Pp-definability Is Co-nexptime-complete
R. Willard
The Constraint Satisfaction Problem: Complexity…
2009
Corpus ID: 9450148
$exists$-InvSat is the problem which takes as input a relation $R$ and a finite set $mathcal S$ of relations on the same finite…
Expand
2007
2007
A Portable Co-Verification System Which Generates Testbench Automatically
Takahito Nakajima
,
Shigeru Namiki
,
Shuhei Kinoshita
,
Naohiko Shimizu
International Conference on Field-Programmable…
2007
Corpus ID: 2498494
Verification is the most time consuming process in an LSI development. The SoC and other complex embedded systems consist of…
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
1999
1999
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits
E. Boros
,
T. Ibaraki
,
K. Makino
IFIP TCS
1999
Corpus ID: 8802562
In this paper we consider four different definitions for an extension of a partially defined Boolean function in which the input…
Expand
1995
1995
Verificación de la difusión de prensa en España
G. Guadalupe
1995
Corpus ID: 161306384
La tesis doctoral aborda un tema de decisiva importancia en el ambito de la prensa y de la publicidad, como es el de la…
Expand
1994
1994
EFFECT OF Co CONTENT ON GROWTH OF ARC DISCHARGE ION-PLATING WC-Co FILM
Y. Li
,
Shenyang
,
Hu Yanqing
,
Zhu Tianjin
1994
Corpus ID: 138049088
Super hard refractory intermetallic WC-Co (Co= 0, 4,15 wt-%) films were prepared by arc discharge ion-plating technique. As the…
Expand
1994
1994
Well-covered graphs: some new sub-classes and complexity results
Lorna Stewart
,
R. Sankaranarayana
1994
Corpus ID: 125393688
A graph is said to be well covered if every maximal independent set has the same size, and very well covered if every maximal…
Expand