Login / Signup
An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity.
Benjamin Rossman
Published in:
Electron. Colloquium Comput. Complex. (2016)
Keyphrases
</>
lower bound
worst case
upper bound
objective function
computational complexity
np hard
average case complexity
space complexity
branch and bound algorithm
high speed
online algorithms
complexity measures
data sets
online learning
memory requirements
digital libraries
average case
optimal cost