An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of Affine Dispersers.
Evgeny DemenkovAlexander S. KulikovPublished in: Electron. Colloquium Comput. Complex. (2011)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound
- high speed
- space complexity
- branch and bound algorithm
- objective function
- complexity analysis
- np hard
- analog circuits
- lower and upper bounds
- affine invariant
- decision problems
- computational complexity
- piecewise affine
- sufficiently accurate
- average case complexity
- real time
- conjunctive query containment
- electronic circuits
- affine transformation
- memory requirements
- linear programming
- optimal solution