Work

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

Year: 2020

Type: book-chapter

Source: Monographs in theoretical computer science

DOI: 10.1007/978-3-662-59362-2_3

Author: Stanisław Gawiejnowicz

Institution: Adam Mickiewicz University in Poznań

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: W3035315564

FWCI: 0.928

Cites:

Cited by: 1

Related to: 10