Login / Signup
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent.
Pascal Koiran
Sylvain Perifel
Published in:
Computational Complexity Conference (2009)
Keyphrases
</>
lower bound
upper bound
constant factor
branch and bound algorithm
high speed
depth information
objective function
threshold selection
window size
arbitrarily close
upper and lower bounds
branch and bound
depth map
worst case
optimal solution
memory requirements
running times
data structure
learning algorithm