:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Kumar, Vinayak M.
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity
Online Access:	https://arxiv.org/abs/2501.02653
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Circuit Lower Bounds and Quantum-Classical Separations
by: Grewal, Sabee, et al.
Published: (2024)

Algebraic Pseudorandomness in $VNC^0$
by: Andrews, Robert
Published: (2025)

Pseudorandomness, symmetry, smoothing: I
by: Derksen, Harm, et al.
Published: (2024)

Pseudorandomness, symmetry, smoothing: II
by: Derksen, Harm, et al.
Published: (2024)

Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions
by: Cheng, Kuan, et al.
Published: (2025)

Pseudorandom bits for non-commutative programs
by: Lee, Chin Ho, et al.
Published: (2025)

A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions
by: Yao, Penghui, et al.
Published: (2025)

Most Juntas Saturate the Hardcore Lemma
by: Kumar, Vinayak M.
Published: (2025)

Hard-to-Sample Distributions from Robust Extractors
by: Byramji, Farzan, et al.
Published: (2026)

QMA vs. QCMA and Pseudorandomness
by: Liu, Jiahui, et al.
Published: (2024)

Relaxed Local Correctability from Local Testing
by: Kumar, Vinayak M., et al.
Published: (2023)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
by: Dwivedi, Ashish, et al.
Published: (2024)

Pseudorandom quantum authentication
by: Haug, Tobias, et al.
Published: (2025)

Pseudorandom density matrices
by: Bansal, Nikhil, et al.
Published: (2024)

Quantum Pseudorandom Scramblers
by: Lu, Chuhan, et al.
Published: (2023)

When Majority Fails: Tight Bounds for Correlation Distillation Conjectures
by: Kamath, Pritish, et al.
Published: (2026)

Hilbert Functions and Low-Degree Randomness Extractors
by: Golovnev, Alexander, et al.
Published: (2024)

Low-Degree Polynomials Are Good Extractors
by: Alrabiah, Omar, et al.
Published: (2024)

Extractors for Polynomial Sources over $\mathbb{F}_2$
by: Chattopadhyay, Eshan, et al.
Published: (2023)

Black-Box Crypto is Useless for Pseudorandom Codes
by: Garg, Sanjam, et al.
Published: (2025)

Unconditional Pseudorandomness against Shallow Quantum Circuits
by: Ghosh, Soumik, et al.
Published: (2025)

From Pseudorandomness to Multi-Group Fairness and Back
by: Dwork, Cynthia, et al.
Published: (2023)

Quantum Pseudorandomness and Classical Complexity
by: Kretschmer, William
Published: (2021)

Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes
by: Grigorescu, Elena, et al.
Published: (2025)

Pseudorandom Permutations from Random Reversible Circuits
by: He, William, et al.
Published: (2024)

Two-Source and Affine Non-Malleable Extractors for Small Entropy
by: Li, Xin, et al.
Published: (2024)

Linear Hashing Is Optimal
by: Jaber, Michael, et al.
Published: (2025)

Pseudorandomness of Expander Walks via Fourier Analysis on Groups
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Pseudorandomness in the (Inverseless) Haar Random Oracle Model
by: Ananth, Prabhanjan, et al.
Published: (2024)

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
by: Grewal, Sabee, et al.
Published: (2022)

Pseudorandom and Pseudoentangled States from Subset States
by: Jeronimo, Fernando Granha, et al.
Published: (2023)

Leakage-Resilient Extractors against Number-on-Forehead Protocols
by: Chattopadhyay, Eshan, et al.
Published: (2025)

Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs
by: Li, Xin, et al.
Published: (2023)

Query Lower Bounds for Correlation Clustering under Memory Constraints
by: Garg, Sumegha, et al.
Published: (2026)

Nearly-Linear Time Seeded Extractors with Short Seeds
by: Doron, Dean, et al.
Published: (2024)

Pseudorandom unitaries are neither real nor sparse nor noise-robust
by: Haug, Tobias, et al.
Published: (2023)

Pseudorandomness of the Sticky Random Walk
by: Anand, Emile, et al.
Published: (2023)

New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String
by: Chen, Lijie, et al.
Published: (2025)

Estimates of the Second Bohr radius for vector-valued Holomorphic functions
by: Arora, Vibhuti, et al.
Published: (2025)

Revisit Of Meromorphic Convex Functions
by: Arora, Vibhuti, et al.
Published: (2025)