Computers and Intractability: A Guide to the Theory of NP-Completeness

In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2013
012319792013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
  • Rodney G. Downeya, Dimitrios M. Thilikosb
  • 2014
One approach to confronting computational hardness is to try to understand the contribution of various parameters to the running… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
Is this relevant?
2013
2013
Bachman A and Janiak A (2004). Scheduling jobs with position dependent processing times. Journal of the Operational Research… (More)
Is this relevant?
2011
2011
One approach to confronting computational hardness is to try to understand the contribution of various parameters to the running… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
Is this relevant?
2009
2009
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
2009
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with… (More)
  • table 1
  • figure 1
  • table 2
Is this relevant?
2007
2007
Yael Berstein Shmuel Onn Abstract In this article we establish an exponential lower bound on the Graver complexity of integer… (More)
Is this relevant?
2000
2000
This paper describes an automat ic method for extracting systematic polysemy from a hierarchically organized semantic lexicon… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
1994
1994
Lemmas 4.1, and 4.6. Therefore we may iteratively repeat the above step generating F Linear time algorithms for testing the… (More)
  • figure 2
  • figure 1
Is this relevant?
1981
1981
The borderline between decidable and undecidable Propositional Dynamic Logic (PDL) is sought when iterative programs represented… (More)
  • figure 2
  • figure 7
Is this relevant?