ACM Symposium on Theory of Computing, STOC 2014


Article Details
Title: Efficient deterministic approximate counting for low-degree polynomial threshold functions
Article URLs:
Alternative Article URLs:
Authors: Anindya De
  • Princeton University, Institute for Advanced Study
Rocco A. Servedio
  • Columbia University New York, NY
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 0832797, 1115703, 1319788
DBLP Key: conf/stoc/DeS14
Author Comments:

Discuss this paper and its artifacts below