Recent Comments
Matthew D Cory on November’s Lectures, 202… jamesmessig on November’s Lectures, 202… Gil Kalai on Quantum Computers: A Brief Ass… Quantum Computers: A… on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… jamesmessig on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… Gil Kalai on November’s Lectures, 202… jamesmessig on November’s Lectures, 202… Gil Kalai on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… -
Recent Posts
- Combinatorial Morning in Tel Aviv, Sunday 28/12/2025
- November’s Lectures, 2025
- Ten Recent Questions for ChatGPT
- A Visit to the Israeli Quantum Computing Center (IQCC)
- Computational Complexity and Explanations in Physics
- Kazhdan Seminar fall 2025 – Starting Today Oct. 19, 2026.
- Explicit Lossless Vertex Expanders!
- Dror Bar-Natan and Roland Van der Veen – A Fast, Strong, and Fun knot invariant!
- Polynomial Bounds for Chowla’s Cosine Problem
Top Posts & Pages
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Combinatorial Morning in Tel Aviv, Sunday 28/12/2025
- TYI 30: Expected number of Dice throws
- Hong Wang and Joshua Zahl's Solution for the Kakeya Problem in Three Dimensions - Reflections and Links
- What is the maximum number of Tverberg's partitions?
- ChatGPT Meets Elchanan Mossel's Dice Problem
- Navier-Stokes Fluid Computers
- Seven Problems Around Tverberg's Theorem
- Touching Simplices and Polytopes: Perles' argument
RSS
Monthly Archives: November 2018
PCP fest, Tel Aviv University, 18-20 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