On the (Non) NP-Hardness of Computing Circuit Complexity.

Cody D. Murray Richard Ryan Williams

Published in: Computational Complexity Conference (2015)

Keyphrases

np hardness
np hard
approximation algorithms
worst case analysis
mixed integer
discrete tomography
special case
scheduling problem
optimal solution
evolutionary algorithm
worst case
high speed