ACM Symposium on Theory of Computing, STOC 2017


Article Details
Title: Succinct hitting sets and barriers to proving algebraic circuits lower bounds
Article URLs:
Alternative Article URLs:
Authors: Michael A. Forbes
  • University of California - Berkeley, Simons Institute for the Theory of Computing
Amir Shpilka
  • Tel Aviv University, Department of Computer Science
Ben Lee Volk
  • Tel Aviv University, Department of Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1617580
DBLP Key: conf/stoc/ForbesSV17
Author Comments:

Discuss this paper and its artifacts below