Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.
Beate BolligStephan WaackPhilipp WoelfelPublished in: IFIP TCS (2002)
Keyphrases
- lower bound
- upper bound
- max sat
- floating point
- objective function
- integer arithmetic
- branch and bound
- graph theory
- error correction
- average case complexity
- graph representation
- optimal solution
- branch and bound algorithm
- directed graph
- structured data
- random walk
- lower and upper bounds
- graph structure
- weighted graph
- directed acyclic graph
- graph model
- np hard
- learning theory
- upper and lower bounds
- constant factor
- social networks