ACM Symposium on Theory of Computing, STOC 2018

Article Details
Title: Hitting sets with near-optimal error for read-once branching programs
Article URLs:
Alternative Article URLs:
Authors: Mark Braverman
  • Princeton University
Gil Cohen
  • Princeton University
Sumegha Garg
  • Princeton University
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/BravermanCG18
Author Comments:

Discuss this paper and its artifacts below