Login / Signup
An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity.
Benjamin Rossman
Published in:
CoRR (2016)
Keyphrases
</>
lower bound
worst case
upper bound
objective function
average case complexity
high speed
branch and bound
computational complexity
computational cost
memory requirements
average case
complexity measures
neural network
digital libraries
vc dimension
lower and upper bounds
circuit design
von neumann
digital topology