Challenging Computational Infeasibility: PCP and Boolean Functions

• Mathematics of lattices

• The advantage of being computationally hard

Examining Our History Through the Lens of Ancient Sedimentary DNA

Subhash Khot, Dor Minzer, Muli Safra:

Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. FOCS 2018: 592-601 

For more publications, click here!

For more information, click here!

Theory-Fest 2022

For all events, click here!

Coming Soon!