CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Addition is exponentially harder than counting for shallow monotone circuits
Authors
Andreev Alexander E.
Beyersdorff Olaf
Dertouzos Michael
Razborov Alexander A.
Publication date
1 January 2017
Publisher
'Association for Computing Machinery (ACM)'
Doi
Cite
Abstract
Abstract is not available.
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1145%2F3055399.305...
Last time updated on 05/08/2021
Warwick Research Archives Portal Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:wrap.warwick.ac.uk:129361
Last time updated on 19/11/2019
