Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution.
Andrzej LingasPublished in: TAMC (2017)
Keyphrases
- lower bound
- upper bound
- worst case
- objective function
- boolean functions
- computational complexity
- branch and bound algorithm
- image processing
- branch and bound
- high speed
- real valued
- optimal solution
- special case
- search algorithm
- lower and upper bounds
- upper and lower bounds
- linear programming relaxation
- analog circuits