A Tight Lower Bound for Dynamic BDD Reordering.
Rüdiger EbendtRolf DrechslerPublished in: MBMV (2004)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- worst case
- branch and bound
- optimal solution
- upper and lower bounds
- information systems
- lower and upper bounds
- objective function
- dynamic environments
- artificial intelligence
- sample complexity
- databases
- single machine
- special case
- similarity measure
- max sat
- dynamically changing
- competitive ratio