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… 
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… 
1997
1997
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
We study a problem in which a set of n jobs has to be batched as well as scheduled for processing on a single machine. A constant… 
1993
1993
Compact Location Problems
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… 
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… 
Highly Cited
1983
Highly Cited
1983
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
  • Y. Yesha
  • SIAM journal on computing (Print)
  • 1983
  • Corpus ID: 36893080
Let $\Sigma $ be a finite alphabet. A set $S \subset \Sigma ^ * $ is called sparse if the number of members of S having length at… 
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)