Recent Comments

Recent Posts
 Reflections: On the Occasion of Ron Adin’s and Yuval Roichman’s Birthdays, and FPSAC 2021
 ICM 2018 Rio (5) Assaf Naor, Geordie Williamson and Christian Lubich
 Test your intuition 47: AGCGTCTGCGTCTGCGACGATC? what comes next in the sequence?
 Cheerful news in difficult times: Richard Stanley wins the Steele Prize for lifetime achievement!
 Combinatorial Theory is Born
 To cheer you up in difficult times 34: Ringel Circle Problem solved by James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, and Bartosz Walczak
 Good Codes papers are on the arXiv
 To cheer you up in difficult times 33: Deep learning leads to progress in knot theory and on the conjecture that KazhdanLusztig polynomials are combinatorial.
 The Logarithmic Minkowski Problem
Top Posts & Pages
 The Argument Against Quantum Computers  A Very Short Introduction
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Reflections: On the Occasion of Ron Adin's and Yuval Roichman's Birthdays, and FPSAC 2021
 TYI 30: Expected number of Dice throws
 The Intermediate Value Theorem Applied to Football
 Zur Luria on the nQueens Problem
 Gil's Collegial Quantum Supremacy Skepticism FAQ
 Amazing: Karim Adiprasito proved the gconjecture for spheres!
 ICM 2018 Rio (5) Assaf Naor, Geordie Williamson and Christian Lubich
RSS
Monthly Archives: November 2018
PCP fest, Tel Aviv University, 1820 December 2018
Conference web site The study of Probabilistically Checkable Proofs, starting with the discovery of the PCP Theorem, is a cornerstone of modern computer science, with impact on complexity theory, algorithms, and cryptography. Born as a purely theoretical notion, mostly used … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Conferences, Updates
Tagged PCP
1 Comment