"Addition is exponentially harder than counting for shallow monotone circuits."

Xi Chen, Igor C. Oliveira, Rocco A. Servedio (2015)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2023-05-30

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/ChenOS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ChenOS15
Xi Chen, Igor C. Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. CoRR abs/1508.03061 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.