Skip to main content
Book Chapter

$$ \mathcal{NP} $$ -complete problems

  • Gawiejnowicz S
DOI: 10.1007/978-3-662-59362-2_3
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The theory of NP-completeness has a great impact on the scheduling theory, since the knowledge about the complexity status of a problem allows us to facilitate further research on the problem. Therefore, in this chapter we recall the most fundamental concepts related...

Cite

CITATION STYLE

APA

Gawiejnowicz, S. (2020). $$ \mathcal{NP} $$ -complete problems (pp. 35–44). https://doi.org/10.1007/978-3-662-59362-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free