Back to Results
First PageMeta Content
Complexity classes / NP-complete / NP-hard / P versus NP problem / NP / Cook–Levin theorem / Boolean satisfiability problem / PP / P / Theoretical computer science / Computational complexity theory / Applied mathematics


Motivation COMS21103 NP-completeness
Add to Reading List

Document Date: 2014-01-08 09:09:08

Open Document

File Size: 240,24 KB

Share Result on Facebook

City

Reading / /

Company

MIT Press / McGraw-Hill / /

Country

United Kingdom / /

Currency

pence / USD / /

/

Facility

University of Bristol Bristol / Clay Mathematics Institute / /

IndustryTerm

polynomial-time algorithm / polynomial-time algorithms / approximate solution / /

Organization

University of Bristol Bristol / University of Illinois / Clay Mathematics Institute / Ashley Montanaro ashley@cs.bris.ac.uk Department of Computer Science / MIT / /

Person

Leonid Levin / Stephen Cook / /

Position

computer scientist / mathematician / Soviet- computer scientist / /

Technology

polynomial-time algorithms / polynomial-time algorithm / /

URL

http /

SocialTag