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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
This paper provides a chronological overview of the topology for multilevel converters, and discusses their different terminology… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In all-wireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are battery-operated. We… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Ordered binary decision diagrams are a useful representation of Boolean functions, if a good variable ordering is known. Variable… (More)
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We introduce a weaker but still NP-complete satisfiability problem to prove NP-completeness of recognizing several classes of… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Cook [l] has shown that 3-SAT, the Boolean satisfiability problem restricted to instances with exactly three variables per clause… (More)
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… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1981
Highly Cited
1981
We show that for each fixed n 3 it is NP-complete to determine whether an arbitrary graph can be edge-partitioned into subgraphs… (More)
  • figure 1
  • figure 2
  • figure 3
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… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 6
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… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?