Addition is exponentially harder than counting for shallow monotone circuits.

Xi Chen Igor Carboni Oliveira Rocco A. Servedio

Published in: STOC (2017)

Keyphrases

upper bound
machine learning
natural language processing
high speed
question answering
information extraction
np complete
boolean functions
data mining
bayesian networks