Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,983,628 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.
2007
2007
Data Complexity in the EL family of DLs
Adila Alfa Krisnadhi
,
C. Lutz
Description Logics
2007
Corpus ID: 14879338
In recent years, lightweight description logics (DLs) have experienced increased interest because they admit highly efficient…
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
2005
2005
Querying and Repairing Inconsistent XML Data
Sergio Flesca
,
F. Furfaro
,
S. Greco
,
E. Zumpano
WISE
2005
Corpus ID: 5164155
The problem of repairing XML data which are inconsistent and incomplete with respect to a set of integrity constraints and a DTD…
Expand
2004
2004
4 , 6-Dimethyl-- pyrone : a matrix isolation study of the photochemical generation of conjugated ketene , Dewar valence isomer and 1 , 3-dimethyl-cyclobutadiene
S. Bredaa
,
L. Lapinskia
,
I. Revaa
,
R. Faustoa
2004
Corpus ID: 23823289
A combined matrix isolation and molecular orbital study of the vibrational spectra and photochemistry of 4,6-dimethyl-pyrone…
Expand
2001
2001
Easy and Hard Constraint Ranking in Optimality Theory: Algorithms and Complexity
Jason Eisner
2001
Corpus ID: 3204529
We consider the problem of ranking a set of OT constraints in a manner consistent with data. We speed up Tesar and Smolensky's…
Expand
2001
2001
STUDY OF GEOCHEMICAL ANOMALIES IN MOMBEJA AREA USING A MULTIFRACTAL METHODOLOGY AND GEOSTATISTICS
A. Gonçalves
,
M. Vairinho
,
V. Oliveira
2001
Corpus ID: 16723617
The present study aims at the characterisation of geochemical anomalies in soils in order to identify possible mineralisations…
Expand
2001
2001
Horndal at Heathrow? Co-operation, Learning and Innovation: Investigating the Processes of Runway Capacity Creation at Europe's most Congested Airports
B. Tether
,
J. Metcalfe
2001
Corpus ID: 11263507
Europe’s most congested airports are London Heathrow, London Gatwick and Frankfurt. There, demand for take-off and landing slots…
Expand
1999
1999
Working with arms: Complexity results on atomic representations of Herbrand models
G. Gottlob
,
R. Pichler
Proceedings. 14th Symposium on Logic in Computer…
1999
Corpus ID: 5433268
An Atomic Representation of a Herbrand Model (ARM) is a finite set of (not necessarily ground) atoms over a given Herbrand…
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
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…
Expand