History of WeakPCPTheorem
ClassS04CS141
|
recent changes
|
Preferences
Revision 6
. . February 10, 2004 8:28 pm by
NealYoung
Revision 5
. . February 10, 2004 8:12 pm by
NealYoung
Revision 3
. . February 10, 2004 5:29 pm by
Neal
Difference (from prior major revision)
(
author diff
)
Added: 17a18,21
In fact, the stronger result holds, but we don't describe a proof:
THEOREM: SAT ∈ PCP(log(n), 1)