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:
CoRR (2017)
Keyphrases
</>
strongly connected components
lower bound
max sat
shortest path
upper bound
connected components
branch and bound algorithm
variable ordering
argumentation semantics
branch and bound
objective function
closed contours
tabu search
np hard
optimal solution
binary images
satisfiability problem
level set
sat problem