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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
In recent years, lightweight description logics (DLs) have experienced increased interest because they admit highly efficient… 
2006
2006
For robust continuous tracking across multiple views for the wide surveillance environment it is helpful to know the geometric… 
2005
2005
The problem of repairing XML data which are inconsistent and incomplete with respect to a set of integrity constraints and a DTD… 
2003
2003
A 13 year old girl presented with auricular chondritis and recurrent episodes of unexplained chest pain, arthritis, bronchitis… 
2002
2002
Molecular dynamic simulation is used to investigate the influence of cluster size and cluster incident energy upon a Cu–Co… 
2001
2001
We consider the problem of ranking a set of OT constraints in a manner consistent with data. We speed up Tesar and Smolensky's… 
2001
2001
Europe’s most congested airports are London Heathrow, London Gatwick and Frankfurt. There, demand for take-off and landing slots… 
2001
2001
The present study aims at the characterisation of geochemical anomalies in soils in order to identify possible mineralisations… 
1999
1999
An Atomic Representation of a Herbrand Model (ARM) is a finite set of (not necessarily ground) atoms over a given Herbrand… 
1993
1993
  • Sanjeev Saluja
  • 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…