Improved rank bounds for design matrices and a new proof of Kelly's theorem

Zeev Dvir, Shubhangi Saraf, Avi Wigderson. Improved rank bounds for design matrices and a new proof of Kelly's theorem. Electronic Colloquium on Computational Complexity (ECCC), 19:138, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.