Login / Signup
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem.
Nutan Limaye
Karteek Sreenivasaiah
Srikanth Srinivasan
Utkarsh Tripathi
S. Venkitesh
Published in:
SIAM J. Comput. (2021)
Keyphrases
</>
fixed size
small size
computer vision
hierarchical structure
fixed number
databases
high quality
multiscale
depth map
scales linearly