An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity.

Benjamin Rossman

Published in: ITCS (2017)

Keyphrases

lower bound
upper bound
worst case
objective function
high speed
branch and bound algorithm
computational cost
complexity measures
computational complexity
average case complexity
data structure
digital libraries
np hard
linear programming