Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture

Publication: 
Proceedings of Symposium on the Theory of Computing (STOC) 2014, pp. 1-48, 2014.
Electronic Colloquium on Computational Complexity (ECCC) Report TR13-190, pp. 1-48, 2013.
Year: 
2013
Files

O. Weinstein

O. Meir

D. Gavinsky

Nati's Long View

Description: 
Nati Linial's 60'th birthday conference, Jerusalem, Israel - December 18, 2013

On Derandomizing Algorithms that Err Extremely Rarely

Publication: 
Proceedings of Symposium on the Theory of Computing (STOC) 2014, pp. 1-21, 2014.
Electronic Colloquium on Computational Complexity (ECCC) Report TR13-152, pp. 1-21, 2013.
Year: 
2013
Files

Non-commutative arithmetic circuits with division

Publication: 
Theory of Computing, vol. 11, pp. 357-393, 2015.
Proceedings of ITCS (Innovations in Theoretical Computer Science) 2014, pp. 49-66, 2014.
Year: 
2014
Files

On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions

Publication: 
Electronic Colloquium on Computational Complexity (ECCC) Report TR13-043, pp. 1-40, 2013.
Year: 
2013
Files

Partial Derivatives in Arithmetic Complexity and Beyond

Publication: 
Foundations and Trends in Theoretical Computer Science (FTTCS), vol. 6, no. 1-2, pp. 1-138
Year: 
2011
Files

Pages

Subscribe to Avi Wigderson RSS