Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Beate BolligPhilipp WoelfelStephan WaackPublished in: Electron. Colloquium Comput. Complex. (2001)
Keyphrases
- lower bound
- upper bound
- max sat
- floating point
- branch and bound algorithm
- objective function
- branch and bound
- average case complexity
- graph representation
- graph theory
- optimal solution
- integer arithmetic
- bipartite graph
- graph structure
- arithmetic operations
- weighted graph
- directed acyclic graph
- lower and upper bounds
- np hard
- graph model
- machine learning
- random walk
- graph databases
- structured data
- directed graph
- graph mining
- error correction
- shortest path
- polynomial approximation
- sample size