Halley Goldberg

According to our database1, Halley Goldberg authored at least 7 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Non-Levin NP-Hardness of Implicit MCSP and PAC Learning under Few Assumptions.
Electron. Colloquium Comput. Complex., 2026

2025
Synergies Between Complexity Theory and Nondeterministic Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2025

Witness Encryption and NP-Hardness of Learning.
Proceedings of the 40th Computational Complexity Conference, 2025

2024
Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov Complexity.
Proceedings of the Approximation, 2024

2023
Improved Learning from Kolmogorov Complexity.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
A Simpler Proof of the Worst-Case to Average-Case Reduction for Polynomial Hierarchy via Symmetry of Information.
Electron. Colloquium Comput. Complex., 2022

Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity.
Proceedings of the 37th Computational Complexity Conference, 2022


  Loading...