The Spectral Norm of Finite Functions
In many recent results in learning and computational complexity theory which rely on Fourier analysis, the spectral norm plays a key role. An understanding of this quantity would appear to be useful in both gauging and exploiting these results, and in understanding the underlying techniques.
Main Author: | Bellare, Mihir |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149700 |
Similar Items
-
Randomness-efficient Sampling of Arbitrary Functions
by: Bellare, Mihir, et al.
Published: (2023) -
Randomness-efficient Sampling of Arbitrary Functions
by: Bellare, Mihir, et al.
Published: (2023) -
Interlacing families and the Hermitian spectral norm of digraphs
by: Greaves, Gary Royden Watson, et al.
Published: (2021) -
Encapsulated Key Escrow
by: Bellare, Mihir, et al.
Published: (2023) -
How to Sign Given Any Trapdoor Permutation
by: Bellare, Mihir, et al.
Published: (2023)