Skip to main content
Avi Wigderson
Personal
Short Bio
CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
Barriers for Rank Methods in Arithmetic Complexity
Submitted by
dloring
on Fri, 2017-10-27 11:39
Author:
K. Efremenko
A. Garg
R. Oliveira
A. Wigderson
Publication:
Proceedings of the Innovations in Theoretical Computer Science (ITCS) 2018, pp. 1:1-1:19, 2018.
Electronic Colloquium on Computational Complexity (ECCC) Report TR17-162, vol. 24, pp. 162, 2017.
Year:
2017
Hide
Files
File:
Proceedings version (pdf)
Draft of final version (pdf)
‹ An Optimal "It Ain't Over Till It's Over" Theorem
up
Breaking the Quadratic Barrier for 3-LCC's over the Reals ›