Valentine Kabanets: Talks

• An invited talk at ELC Tokyo Complexity Workshop, Tokyo, Japan (March 2013)

  Yin and Yang of Computing: From circuit lower bounds to compression and SAT algorithms, and back

• An invited talk at CiE 2012, Cambridge, England (June 2012)

  Meta-Algorithms vs. Circuit Lower Bounds

• An invited talk at TAMC 2011, Tokyo, Japan (May 2011)

  Meta-Algorithms vs. Circuit Lower Bounds

• A plenary talk at the Barriers Workshop, Princeton, NJ, USA (August 2009)

  Derandomization vs. Circuit Lower Bounds

---

Back to home page