The Library
Addition is exponentially harder than counting for shallow monotone circuits
Tools
Chen, Xi, Oliveira, Igor Carboni and Servedio, Rocco A. (2017) Addition is exponentially harder than counting for shallow monotone circuits. In: 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), Montreal, QC, Canada, 19-23 Jun 2017. Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC) pp. 1232-1245. ISBN 9781450345286. doi:10.1145/3055399.3055425
|
PDF
WRAP-addition-exponentially-harder-counting-shallow-monotone-circuits-Oliveira-2017.pdf - Accepted Version - Requires a PDF viewer. Download (861Kb) | Preview |
Official URL: http://dx.doi.org/10.1145/3055399.3055425
Item Type: | Conference Item (Paper) | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | |||||||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | |||||||||
Library of Congress Subject Headings (LCSH): | Monotone operators, Boolean matrices, Threshold logic, Computational complexity | |||||||||
Journal or Publication Title: | Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC) | |||||||||
Publisher: | ACM | |||||||||
ISBN: | 9781450345286 | |||||||||
Book Title: | Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 | |||||||||
Official Date: | 2017 | |||||||||
Dates: |
|
|||||||||
Page Range: | pp. 1232-1245 | |||||||||
DOI: | 10.1145/3055399.3055425 | |||||||||
Status: | Peer Reviewed | |||||||||
Publication Status: | Published | |||||||||
Reuse Statement (publisher, data, author rights): | © ACM 2017. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), http://dx.doi.org/10.1145/3055399.3055425 | |||||||||
Access rights to Published version: | Restricted or Subscription Access | |||||||||
Date of first compliant deposit: | 8 November 2019 | |||||||||
Date of first compliant Open Access: | 8 November 2019 | |||||||||
RIOXX Funder/Project Grant: |
|
|||||||||
Conference Paper Type: | Paper | |||||||||
Title of Event: | 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC) | |||||||||
Type of Event: | Conference | |||||||||
Location of Event: | Montreal, QC, Canada | |||||||||
Date(s) of Event: | 19-23 Jun 2017 |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year