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 expectation-thresholds
- 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?
- TYI 30: Expected number of Dice throws
- Lior, Aryeh, and Michael
- 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
Tag Archives: Hao Huang
Amazing: Hao Huang Proved the Sensitivity Conjecture!
Today’s arXived amazing paper by Hao Huang Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture Contains an amazingly short and beautiful proof of a famous open problem from the theory of computing – the sensitivity conjecture posed … Continue reading
Posted in Combinatorics, Computer Science and Optimization
Tagged Hao Huang, sensitivity conjecture
23 Comments