( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits.

, , , и . NeurIPS, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Shuichi Hasegawa

Stephan Shuichi Haupt

 

Другие публикации лиц с тем же именем

Capturing One-Way Functions via NP-Hardness of Meta-Complexity.. STOC, стр. 1027-1038. ACM, (2023)Cryptographic hardness under projections for time-bounded Kolmogorov complexity., , , и . Theor. Comput. Sci., 940 (Part): 206-224 (2023)Learning versus Pseudorandom Generators in Constant Parallel Time., и . Electron. Colloquium Comput. Complex., (2022)Learning in Pessiland via Inductive Inference., и . FOCS, стр. 447-457. IEEE, (2023)Symmetric Exponential Time Requires Near-Maximum Circuit Size., , и . STOC, стр. 1990-1999. ACM, (2024)Kolmogorov Complexity Characterizes Statistical Zero Knowledge., , и . ITCS, том 251 из LIPIcs, стр. 3:1-3:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Beyond Natural Proofs: Hardness Magnification and Locality., , , , , и . ITCS, том 151 из LIPIcs, стр. 70:1-70:48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH., и . SODA, стр. 2346-2365. SIAM, (2021)Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity.. FOCS, стр. 50-60. IEEE, (2020)A Duality between One-Way Functions and Average-Case Symmetry of Information., , , , и . STOC, стр. 1039-1050. ACM, (2023)