Skip to search formSkip to main contentSkip to account menu

NP (complexity)

Known as: NP, NP (complexity class), Class NP 
In computational complexity theory, NP is a complexity class used to describe certain types of decision problems. Informally, NP is the set of all… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Motivated by the need to combine systems and logics, we develop a modular approach to the model expansion (MX) problem, a task… 
Highly Cited
2002
Highly Cited
2002
We present a bootstrapping method that uses strong syntactic heuristics to learn semantic lexicons. The three sources of… 
Highly Cited
2000
Highly Cited
2000
1. Preface 2. Introduction 3. Eliminating Disjunction in Lexical Specification (by Adger, David) 4. Adjectives and Argument… 
2000
2000
In this paper we pay special attention to personal names documented in the southeastern variety of Iberian script. 
1999
1999
Fuzzy cognitive maps (FCM) is a powerful framework for representing structured human knowledge and causal inference. This paper… 
1992
1992
We consider polynomial time nondeterministic machines, and augment the nodes of the tree associated with a computation by… 
1992
1992
We introduce m-valued locally definable acceptance types, a new model generalizing the idea of alternating machines and their… 
1969
1969
WE have recently measured the pulsed emission of high energy X-rays from the Crab Nebula pulsar NP 0532. Pulsation of the low…