Work

NP-complete problems

Year: 2003

Type: reference-entry

Source: Encyclopedia of Computer Science

Authors: Daniel J. Rosenkrantz, Richard E. Stearns

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W23339264

Cites: 4

Cited by: 18

Related to: 10