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.
2016
2016
A Computationally Efficient Approach for Mining Similar Temporal Patterns
Temporal association patterns are those patterns which are obtained from time stamped temporal databases. A temporal association… 
Highly Cited
2016
Highly Cited
2016
Improving Nonintrusive Load Monitoring Efficiency via a Hybrid Programing Method
Nonintrusive load monitoring (NILM) aims to disaggregate the total power consumption profile measured at the household power… 
2011
2011
A Semantic Account for Modularity in Multi-language Modelling of Search Problems
Motivated by the need to combine systems and logics, we develop a modular approach to the model expansion (MX) problem, a task… 
2009
2009
Approximating the linear combination of log-normal RVs via pearson type IV distribution for UWB performance analysis
Approximating the sum of log-normal random variables (RVs) is a long-standing open issue and many studies in the old and recent… 
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… 
2000
2000
Crónica de onomástica paleo-hispânica (9)
In this paper we pay special attention to personal names documented in the southeastern variety of Iberian script. 
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… 
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)