Complete

Known as: Complete problem, Hard 
In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1935-2018
01000200019352017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2000
Highly Cited
2000
Completeness is an ideal, although uncommon, feature of abstract interpretations, formalizing the intuition that, relatively to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
-We consider a 2-layer, 3-node, n-input neural network whose nodes compute linear threshold functions of their inputs. We show… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Complete axiomizations for the algebras of infinite trees and infinite trees are presented. The axiomizations are parameterized… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We present a polynomial-time algorithm that, given as a input the description of a game with <italic>incomplete information and… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Many interesting combinatorial problems were found to be NP-complete. Since there is little hope to solve them fast in the worst… (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
This is the fourth edition of a quarterly column the purpose of which is to provide continuing coverage of new developments in… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
In the theory of recursive functions and computational complexity it has been demonstrated repeatedly that the natural problems… (More)
  • figure 2
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?
Highly Cited
1973
Highly Cited
1973
The search for efficient algorithms for register allocation dates back to the time of the first Fortran compiler for the IBM 704… (More)
  • figure 1.2
  • figure 1.3
  • figure 3.5
  • figure 4.3
  • figure 4.5
Is this relevant?