Hardness vs Randomness for Bounded Depth Arithmetic Circuits.

Chi-Ning Chou Mrinal Kumar Noam Solomon

Published in: Computational Complexity Conference (2018)

Keyphrases

depth information
high speed
phase transition
np hard
depth map
computational complexity
worst case
digital circuits
lateral inhibition
image sequences
vlsi circuits
fixed parameter tractable
analog vlsi
quantum computing
electronic circuits
arithmetic operations
np hardness
learning theory