Texonom
/
Computing
/
Computing Theory
/
Information Theory
/
Complexity Theory
/
P versus NP problem
/
NP-complete
Search
NP-complete
Creator
Creator
Seonglae Cho
Created
Created
2023 Sep 9 16:34
Editor
Editor
Seonglae Cho
Edited
Edited
2023 Dec 19 4:45
Refs
Refs
Polynomial-time Reduction
NP complete problem is
NP-hard
diagram is prediction
NP-complete problems
Proving NP-completeness
Recommendations
Texonom
/
Computing
/
Computing Theory
/
Information Theory
/
Complexity Theory
/
P versus NP problem
/
NP-complete