Login / Signup
Addition is exponentially harder than counting for shallow monotone circuits.
Xi Chen
Igor Carboni Oliveira
Rocco A. Servedio
Published in:
Electron. Colloquium Comput. Complex. (2015)
Keyphrases
</>
upper bound
case study
neural network
information extraction
natural language processing
real world
genetic algorithm
computer vision
bayesian networks
boolean functions