Login / Signup
On the (Non) NP-Hardness of Computing Circuit Complexity.
Cody Murray
Ryan Williams
Published in:
Electron. Colloquium Comput. Complex. (2014)
Keyphrases
</>
np hardness
np hard
approximation algorithms
worst case analysis
mixed integer
high speed
discrete tomography
optimal solution
scheduling problem
lower bound
multi dimensional
particle swarm optimization