An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers.
Evgeny DemenkovAlexander S. KulikovPublished in: MFCS (2011)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- lower and upper bounds
- optimal solution
- high speed
- complexity analysis
- image registration
- average case complexity
- computational complexity
- neural network
- branch and bound
- theorem prover
- objective function
- electronic circuits
- sufficiently accurate
- piecewise affine
- np complete
- decision problems
- learning algorithm