| Title: |
Addition is exponentially harder than counting for shallow monotone circuits |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Xi Chen |
-
Columbia University New York, NY 10027 U.S.A.
|
| Igor Carboni Oliveira |
-
Charles University in Prague Prague, Czech Republic
|
| Rocco A. Servedio |
-
Columbia University New York, NY 10027 U.S.A.
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1149257,
1423100,
1319788,
1420349
|
| DBLP Key: |
conf/stoc/ChenOS17
|
| Author Comments: |
|