The DAG Visit Approach for Pebbling and I/O Lower Bounds.

Gianfranco Bilardi Lorenzo De Stefani

Published in: FSTTCS (2022)

Keyphrases

lower bound
clause learning
directed acyclic graph
upper bound
input output
branch and bound
branch and bound algorithm
sat solvers
np hard
objective function
file system
optimal solution
sat problem
vc dimension
np complete
phase transition
satisfiability problem
special case
storage systems