NP-Hard Problems and Approximation Algorithms

Ding-Zhu Du, Panos Pardalos, Xiaodong Hu and Weili Wu
Additional contact information
Ding-Zhu Du: University of Texas, Dallas
Panos Pardalos: University of Florida
Xiaodong Hu: Chinese Academy of Sciences
Weili Wu: University of Texas at Dallas

Chapter Chapter 8 in Introduction to Combinatorial Optimization, 2022, pp 199-257 from Springer

Abstract: Abstract The class P consists of all polynomial-time solvable decision problems. What is the class NP? There are two popular misunderstandings: (1) NP is the class of problems which are not polynomial-time solvable. (2) A decision problem belongs to the class NP if its answer can be checked in polynomial-time.

Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-10596-8_8

Ordering information: This item can be ordered from
http://www.springer.com/9783031105968

DOI: 10.1007/978-3-031-10596-8_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().