More Like this

1. Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds

   Efremenko, Klim ; Kol, Gillat ; Paramonov, Dmitry ; Saxena, Raghuvansh R. ( January 2023 , Innovations in Theoretical Computer Science (ITCS))
2. New Lower Bounds and Upper Bounds for Listing Avoidable Vertices

   Deng, Mingyang and ( January 2022 , 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022))
3. Asymptotic entropy bounds

   https://doi.org/10.1103/PhysRevD.94.024018  

   Bousso, Raphael ( July 2016 , Physical Review D)
4. Uniform bounds for Weil-Petersson curvatures: UNIFORM BOUNDS FOR WEIL-PETERSSON CURVATURES

   https://doi.org/10.1112/plms.12152  

   Wolf, Michael ; Wu, Yunhui ( June 2018 , Proceedings of the London Mathematical Society)
5. Bounds in query learning

   Chase, Hunter ; Freitag, James ( July 2020 , Conference on Learning Theory)

   Abernethy, Jacob ; Agarwal, Shivani (Ed.)

   We introduce new combinatorial quantities for concept classes, and prove lower and upper bounds for learning complexity in several models of learning in terms of various combinatorial quantities. In the setting of equivalence plus membership queries, we give an algorithm which learns a class in polynomially many queries whenever any such algorithm exists. Our approach is flexible and powerful enough to give new and very short proofs of the efficient learnability of several prominent examples (e.g. regular languages and regular ω-languages), in some cases also producing new bounds on the number of queries. 

   more » « less