Alexander Razborov
Top View
- Arxiv:1504.03398V1 [Cs.CC] 14 Apr 2015
- Computational Complexity: a Modern Approach
- 2010 Nevanlinna Prize Awarded
- Challenges in Computational Lower Bounds
- On Black-Box Reductions Between Predicate Encryption Schemes
- 1 This Issues Column!
- Barriers for Rank Methods in Arithmetic Complexity
- Testing Properties of Boolean Functions: Lower Bounds on Testing Fourier Degree
- Chicago Journal of Theoretical Computer Science MIT Press
- Thinking Algorithmically About Impossibility∗
- ANNUAL REPORT 2019-2020 Contents
- The 2013 Noticesindex
- Department of Computer Science 1
- On a Theorem of Razborov
- Four Results of Jon Kleinberg 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize a Talk for St.Petersburg Mathematical Society Who Is Jon Kleinberg
- Communication Complexity
- Mathematisches Forschungsinstitut Oberwolfach Proof Complexity And
- John Von Neumann