Certified Hardness vs. Randomness for Log-Space

Pyne, Edward; Raz, Ran; Zhan, Wei

doi:10.1109/focs57990.2023.00061

2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) 2023

DOI: 10.1109/focs57990.2023.00061

|View full text |Cite

Certified Hardness vs. Randomness for Log-Space

Edward Pyne,

Ran Raz,

Wei Zhan

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Other3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting

Chen,

Hoza,

Lyu

et al. 2023

2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting

Chen,

Hoza,

Lyu

et al. 2023

2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness

Li,

Pyne,

Tell

2024

2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

View full text Add to dashboard Cite

Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL

Doron,

Pyne,

Tell

2024

Proceedings of the 56th Annual ACM Symposium on Theory of Computing

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Certified Hardness vs. Randomness for Log-Space

Cited by 3 publications

References 31 publications

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting

Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness

Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL

Contact Info

Product

Resources

About