professor of EECS at MIT. working in theoretical computer science namely algorithm design, complexity theory, circuit complexity, etc. i'll let you know when P != NP is proved (and when it's not)
professor of EECS at MIT. working in theoretical computer science namely algorithm design, complexity theory, circuit complexity, etc. i'll let you know when P != NP is proved (and when it's not)