Login / Signup
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter.
Krishnendu Chatterjee
Wolfgang Dvorák
Monika Henzinger
Veronika Loitzenbauer
Published in:
SODA (2018)
Keyphrases
</>
strongly connected components
lower bound
max sat
connected components
shortest path
upper bound
branch and bound algorithm
branch and bound
variable ordering
objective function
argumentation semantics
tabu search
np hard
sat solvers
search algorithm
np complete
scheduling problem
closed contours
three dimensional