Complexity Class

Theoretical Comp. Sci. » Algorithms

P vs. NP ★★★★

Author(s): Cook; Levin

Problem Is P = NP?

Keywords: Complexity Class; Computational Complexity; Millenium Problems; NP; P; polynomial algorithm

Posted by zitterbewegung
updated October 18th, 2007

add new comment