<--- Back to Details
First PageDocument Content
Complexity classes / P versus NP problem / NP / IP / P-complete
Date: 2016-04-18 15:41:22
Complexity classes
P versus NP problem
NP
IP
P-complete

MCS 441 – Theory of Computation I Spring 2016 Problem Set 5∗ Lev Reyzin Due: at the beginning of class

Add to Reading List

Source URL: homepages.math.uic.edu

Download Document from Source Website

File Size: 146,28 KB

Share Document on Facebook

Similar Documents