Login / Signup
An improved homomorphism preservation theorem from lower bounds in circuit complexity.
Benjamin Rossman
Published in:
ACM SIGLOG News (2016)
Keyphrases
</>
lower bound
upper bound
worst case
average case complexity
branch and bound
objective function
branch and bound algorithm
computational complexity
scheduling problem
computational cost
high speed
von neumann
complexity measures
neural network
decision problems
optimal solution
digital circuits
min sum