Recent Comments

Recent Posts
 TYI 41: How many steps does it take for a simple random walk on the discrete cube to reach the uniform distribution?
 Gil’s Collegial Quantum Supremacy Skepticism FAQ
 Amazing! Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park: Thresholds versus fractional expectationthresholds
 Starting today: Kazhdan Sunday seminar: “Computation, quantumness, symplectic geometry, and information”
 The story of Poincaré and his friend the baker
 Gérard Cornuéjols’s baker’s eighteen 5000 dollars conjectures
 Noisy quantum circuits: how do we know that we have robust experimental outcomes at all? (And do we care?)
 Test Your Intuition 40: What Are We Celebrating on Sept, 28, 2019? (And answer to TYI39.)
 Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
Top Posts & Pages
 Gil's Collegial Quantum Supremacy Skepticism FAQ
 TYI 41: How many steps does it take for a simple random walk on the discrete cube to reach the uniform distribution?
 Lior, Aryeh, and Michael
 TYI 30: Expected number of Dice throws
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
 Amazing: Hao Huang Proved the Sensitivity Conjecture!
 Jeff Kahn and Jinyoung Park: Maximal independent sets and a new isoperimetric inequality for the Hamming cube.
 Aubrey de Grey: The chromatic number of the plane is at least 5
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