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

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)

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

- Rodney G. Downey, Dimitrios M. Thilikos
- Computer Science Review
- 2011

One approach to confronting computational hardness is to try to understand the contribution of various parameters to the runningâ€¦Â (More)

Is this relevant?

2009

2009

- Stephan Kreutzer
- CSL
- 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)

Is this relevant?

2009

2009

The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing withâ€¦Â (More)

Is this relevant?

2007

2007

- Yael Berstein, Shmuel Onn
- ArXiv
- 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

- Noriko Tomuro
- 2000

This paper describes an automat ic method for extracting systematic polysemy from a hierarchically organized semantic lexiconâ€¦Â (More)

Is this relevant?

1994

1994

- W F Dowling, M. R. Garey, +4 authors Robert E. Tarjan
- 1994

Lemmas 4.1, and 4.6. Therefore we may iteratively repeat the above step generating F Linear time algorithms for testing theâ€¦Â (More)

Is this relevant?

1981

1981

- David Harel, Amir Pnueli, Jonathan Stavi
- 22nd Annual Symposium on Foundations of Computerâ€¦
- 1981

The borderline between decidable and undecidable Propositional Dynamic Logic (PDL) is sought when iterative programs representedâ€¦Â (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

Â

Is this relevant?