Login / Signup
Addition is exponentially harder than counting for shallow monotone circuits.
Xi Chen
Igor Carboni Oliveira
Rocco A. Servedio
Published in:
CoRR (2015)
Keyphrases
</>
information extraction
natural language processing
question answering
machine learning
case study
data sets
bayesian networks
artificial neural networks
np hard
low cost
high speed
boolean functions
delay insensitive