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)

Related topics

Related topics

50 relations
Advice (complexity)Arthur–Merlin protocolBQPBoolean hierarchy

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Multi-queued network processors for packets with heterogeneous processing requirements
Modern network processors (NPs) increasingly deal with packets with heterogeneous processing requirements. In this work, we… 
2006
2006
Uplink user capacity in a multicell CDMA system with hotspot microcells
The number of simultaneous users (or user capacity) supportable on the uplink of a multiple-macrocell code division multiple… 
Highly Cited
2002
Highly Cited
2002
Exploiting Strong Syntactic Heuristics and Co-Training to Learn Semantic Lexicons
We present a bootstrapping method that uses strong syntactic heuristics to learn semantic lexicons. The three sources of… 
Highly Cited
2000
Highly Cited
2000
Lexical specification and insertion
1. Preface 2. Introduction 3. Eliminating Disjunction in Lexical Specification (by Adger, David) 4. Adjectives and Argument… 
1993
1993
Compact Location Problems
1992
1992
Locally Definable Acceptance Types - The Three-Valued Case
We consider polynomial time nondeterministic machines, and augment the nodes of the tree associated with a computation by… 
1992
1992
Locally Definable Acceptance Types for Polynomial Time Machines
We introduce m-valued locally definable acceptance types, a new model generalizing the idea of alternating machines and their… 
1991
1991
Statistical Agenda Parsing
This paper presents the results of converting a standard Graham/Harrison/Ruzzo (GHR) parser for a unification grammar into an… 
Review
1978
Review
1978
The solar wind influences plasmasphere electron content
MAGNETOSPHERIC plasma convection has been reviewed in detail by Axford1. A viscous-like interaction between plasma and magnetic… 
1967
1967
Extreme coverings of n-space by spheres
It is well known that the problem of determining the most economical covering of n-dimensional Eucidean space, by equal spheres… 
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)