A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function.
Magnus Gausdal FindAlexander GolovnevEdward A. HirschAlexander S. KulikovPublished in: FOCS (2016)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound algorithm
- high speed
- average case complexity
- lower and upper bounds
- branch and bound
- optimal solution
- complexity analysis
- decision problems
- piecewise linear
- objective function
- np hard
- computational complexity
- low cost
- search algorithm
- space complexity
- approximation error