✳flâneur — a map of the web's best reading

Computational Complexity: Favorite Theorems: Relativization

blog.computationalcomplexity.org · 1,755 words · saved by 1 readers

February Edition After the work of Cook and Karp popularized the P versus NP question, computer scientists immediately tried hard to prove...

Computational Complexity: Favorite Theorems: Relativization Tuesday, March 21, 2006 Favorite Theorems: Relativization February Edition After the work of Cook and Karp popularized the P versus NP question, computer scientists immediately tried hard to prove P=NP or P≠NP. Baker, Gill and Solovay showed that most of their approaches were doomed to failure. Theodore Baker, John Gill, Robert Solovay, Relativization of the P=?NP Question , SICOMP 1975. Baker, Gill and Solovay noted that complexity proofs relativized, that is held even if all machines involved could make queries to some "oracle

Explore this link on the map →

related reading