Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,229,793 papers from all fields of science
Search
Sign In
Create Free Account
NP (complexity)
Known as:
NP
, NP (complexity class)
, Class NP
Expand
In computational complexity theory, NP is a complexity class used to describe certain types of decision problems. Informally, NP is the set of all…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Advice (complexity)
Arthur–Merlin protocol
BQP
Boolean hierarchy
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
Ambiguity Management in Grammar Writing
Tracy Holloway King
,
Stefanie Dipper
,
A. Frank
,
Jonas Kuhn
,
John T. Maxwell
2004
Corpus ID: 8668147
When linguistically motivated grammars are implemented on a largerscale and applied to real-life corpora, keeping track…
Expand
2002
2002
EFFECTS OF NP SUPPLY ON GROWTH, DEVELOPMENT, YIELD AND ACTIVE SUBSTANCES OF GARDEN THYME (THYMUS VULGARIS L.)
R. Omidbaigi
,
A. Arjmandi
2002
Corpus ID: 89808213
Effect of nitrogen and phosphorous supply was investigated on 3-year-old garden thyme (Thymus vulgaris L) population. The…
Expand
2001
2001
On the Foundations of Answer Set Programming
V. Marek
,
J. Remmel
ASp
2001
Corpus ID: 7323685
Schlipf (Schlipf 1995) proved that the Stable Logic Programming solves all NP decision problems. We extend Schlipf’s result to…
Expand
2000
2000
Inherent Binding and the Syntax/Lexicon Interface: Distinguishing DP, NP, and N
T. Roeper
2000
Corpus ID: 63255466
1998
1998
The complexity of obtaining solutions for problems in NP
Birgit Jenner
,
J. Torán
1998
Corpus ID: 18948035
A screwdriver bit has a threaded portion forming a tap immediately adjacent the screw engaging end of the screwdriver.
Review
1994
Review
1994
Complexity classes defined via k-valued functions
U. Hertrampf
Proceedings of IEEE 9th Annual Conference on…
1994
Corpus ID: 3091755
A lot of complexity classes can be characterized by posing some global acceptance condition on the computation trees produced by…
Expand
1994
1994
Two Refinements of the Polynomial Hierarcht
V. Selivanov
Symposium on Theoretical Aspects of Computer…
1994
Corpus ID: 39713299
We introduce and study two classifications refining the polynomial hierarchy. Both extend the difference hierarchy over NP and…
Expand
1992
1992
Locally Definable Acceptance Types - The Three-Valued Case
U. Hertrampf
Latin American Symposium on Theoretical…
1992
Corpus ID: 43509010
We consider polynomial time nondeterministic machines, and augment the nodes of the tree associated with a computation by…
Expand
1992
1992
Locally Definable Acceptance Types for Polynomial Time Machines
U. Hertrampf
Symposium on Theoretical Aspects of Computer…
1992
Corpus ID: 12504602
We introduce m-valued locally definable acceptance types, a new model generalizing the idea of alternating machines and their…
Expand
1963
1963
Some significance of soil organic phosphorus mineralization in the phosphorus nutrition of cocoa in Ghana
D. Acquaye
Plant and Soil
1963
Corpus ID: 42692344
Summary1. Soil samples from a 22 NP:KMg factorial experiment, in which yield response of cocoa to NP was highly correlated to…
Expand