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

Gianfranco Bilardi Lorenzo De Stefani

Published in: CoRR (2022)

Keyphrases

lower bound
clause learning
upper bound
directed acyclic graph
branch and bound
input output
branch and bound algorithm
sat solvers
np hard
objective function
main memory
file system
optimal solution
vc dimension
max sat
min sum
heuristic search
database management systems
sat problem
genetic algorithm