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
Improved rank bounds for design matrices and a new proof of Kelly's theorem
Submitted by
dloring
on Mon, 2015-05-04 20:12
Author:
Z. Dvir
S. Saraf
A. Wigderson
Publication:
Forum of Mathematics, Sigma 4, vol. 2, 2014
Electronic Colloquium on Computational Complexity (ECCC) Report TR12-138, 2012.
Year:
2014
Abstract:
Abstract
Hide
Files
File:
Journal version (pdf)
‹ Explicit Capacity Approaching Coding for Interactive Communication
up
Interactive proofs of proximity: delegating computation in sublinear time ›