Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication.
Beate BolligStephan WaackPhilipp WoelfelPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- lower bound
- upper bound
- floating point
- max sat
- graph representation
- branch and bound algorithm
- objective function
- constant factor
- graph matching
- integer arithmetic
- graph model
- graph theory
- directed graph
- np hard
- branch and bound
- bipartite graph
- optimal solution
- upper and lower bounds
- graph mining
- random walk
- special case
- weighted graph
- directed acyclic graph
- lower and upper bounds
- search space
- arithmetic operations
- sufficiently accurate
- social networks