Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL
We provide compelling evidence for the potential of hardness-vs.-randomness approaches to make progress on the long-standing problem of derandomizing space-bounded computation. Our first contribution is a derandomization of bounded-space machines from hardness assumptions for classes of uniform dete...
Main Authors: | Doron, Dean, Pyne, Edward, Tell, Roei |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 56th Annual ACM Symposium on Theory of Computing
2024
|
Online Access: | https://hdl.handle.net/1721.1/155721 |
Similar Items
-
Identifying BPL households : a comparison of methods
by: Alkire, S, et al.
Published: (2012) -
Determining BPL status : some methodological improvements
by: Alkire, S, et al.
Published: (2009) -
Selecting a targeting method to identify BPL households in India
by: Alkire, S, et al.
Published: (2012) -
Impact of BPL penalty functions and PSF models in PET/CT radial spatial resolution recovery
by: Si, Wang Jie
Published: (2024) -
An evaluation of the level of awareness of Broadband over Power Lines (BPL) and its standard / Norlizawati Nawi
by: Nawi, Norlizawati
Published: (2006)