Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin.

Neeraj Kayal Chandan Saha

Published in: Computational Complexity Conference (2015)

Keyphrases

lower bound
upper bound
lower and upper bounds
objective function
optimal solution
high speed
three dimensional
branch and bound
worst case
np hard
data sets
small number
constraint satisfaction problems
branch and bound algorithm
depth information
digital circuits
logic synthesis