Recent Comments
-
Recent Posts
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- Igor Pak: How I chose Enumerative Combinatorics
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Noga Alon and Udi Hrushovski won the 2022 Shaw Prize
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Past and Future Events
- Joshua Hinman proved Bárány’s conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- Combinatorial Convexity: A Wonderful New Book by Imre Bárány
Top Posts & Pages
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Igor Pak: How I chose Enumerative Combinatorics
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- Richard Stanley: How the Proof of the Upper Bound Theorem (for spheres) was Found
- The Argument Against Quantum Computers - A Very Short Introduction
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- To cheer you up in difficult times 13: Triangulating real projective spaces with subexponentially many vertices
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