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]

@article{DvirSW12,
  title = {Improved rank bounds for design matrices and a new proof of Kelly's theorem},
  author = {Zeev Dvir and Shubhangi Saraf and Avi Wigderson},
  year = {2012},
  url = {http://eccc.hpi-web.de/report/2012/138},
  researchr = {https://researchr.org/publication/DvirSW12},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {19},
  pages = {138},
}