Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. Forbes, M. A., Shpilka, A., & Volk, B. L. Electronic Colloquium on Computational Complexity (ECCC), 24:7, 2017.
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds [link]Paper  bibtex   
@article{DBLP:journals/eccc/ForbesSV17,
  author    = {Michael A. Forbes and
               Amir Shpilka and
               Ben Lee Volk},
  title     = {Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower
               Bounds},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {7},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/007},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/ForbesSV17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0