Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

NP-completeness

Known as: Non-deterministic polynomial-time complete, NPC, NP 
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. The set of NP-complete problems is often… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1995
Highly Cited
1995
Algorithms for learning Bayesian networks from data have two components: a scoring metric and a search procedure. The scoring… Expand
  • table 12.2
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1987
Highly Cited
1987
AbstractIn continuous variable, smooth, nonconvex nonlinear programming, we analyze the complexity of checking whether(a)a given… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
  • B. Baker
  • 24th Annual Symposium on Foundations of Computer…
  • 1983
  • Corpus ID: 9706753
This paper describes a general technique that can be used to obtain approximation algorithms for various NP-complete problems on… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1981
Highly Cited
1981
We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1981
Highly Cited
1981
We show that the following problem is NP-complete. Given a graph, find the minimum number of edges (fill-in) whose addition makes… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
This paper was motivated by a practical problem related to databases for image processing: given a set of points in the plane… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1977
Highly Cited
1977
An optimum rectilinear Steiner tree for a set A of points in the plane is a tree which interconnects A using horizontal and… Expand
Is this relevant?
Highly Cited
1976
Highly Cited
1976
We demonstrate that cons&g optimal binary de&ion trees ia an NP=compkt.e probtem, where an op timal tree is one which minin&s the… Expand
Is this relevant?
Highly Cited
1975
Highly Cited
1975
  • J. Ullman
  • J. Comput. Syst. Sci.
  • 1975
  • Corpus ID: 40001207
We show that the problem of finding an optimal schedule for a set of jobs is NP-complete even in the following two restricted… Expand
Is this relevant?
Highly Cited
1974
Highly Cited
1974
It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this… Expand
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?