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

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

> Home

Details and statistics

DOI: 10.1145/3055399.3055425

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/ChenOS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/ChenOS17
Xi Chen, Igor C. Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. STOC 2017: 1232-1245

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.