|
Probabilistically Checkable Proofs
|
Probabilistically Checkable Proofs
Khot gives a survey of PCPs, known hardness results, and techniques used to build PCPs. Computing approximate solutions is a way to cope with NP-complete problems. A tool called Probabilistically Checkable Proofs (PCPs) is used to establish hardness of approximation results. From the Series:CSE Colloquia - 2003
Video Length: 2947
Date Found: February 12, 2009
Date Produced: May 06, 2003
View Count: 6
|
|
|
|
|
I got punched by an old guy, for farting near his wife. Read MoreComic book creator Stan Lee talks the future of the medium in the digital age. Panelists Zachary... Read MoreThe U.S. launch of Spotify is still on music lovers' minds. Join Zachary Levi, from NBC’s... Read MoreTuesday: Rupert Murdoch testifies before Parliament on the hacking scandal that brought down "News... Read MoreAfter a long slump, the home construction industry may be showing signs of life. But as Bill... Read More | 1 2 3 4 5 |
|
|
|