User contributions
Jump to navigation
Jump to search
- 22:10, 11 January 2014 diff hist +13 Complexity Zoo:P →PCP(r(n),q(n)): Probabilistically Checkable Proof: NP=PCP(log n, log n), NEXP=PCP(poly(n), poly(n))