( en | de | ru )

 

Disambiguation of "Li, Zeyong"

Author of the publication

copydeleteadd this publication to your clipboard
On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity.

, , , , , and . Electron. Colloquium Comput. Complex., (2023)

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. You can also use the button next to the name to display some publications already assigned to the person.

Li Li

Li Li

Li Li

Li Li

Li Li

 

Other publications of authors with the same name

Lattice Problems beyond Polynomial Time., , , , , , , , and . STOC, page 1516-1526. ACM, (2023)The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs., and . PODC, page 32-43. ACM, (2023)Oblivious Classes Revisited: Lower Bounds and Hierarchies., , and . Electron. Colloquium Comput. Complex., (2024)Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform.. CoRR, (2023)On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity., , , , , and . Electron. Colloquium Comput. Complex., (2023)Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform.. STOC, page 2000-2007. ACM, (2024)A computation model with automatic functions and relations as primitive operations., , , , and . Theor. Comput. Sci., (2022)Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms., , , , and . SODA, page 2444-2462. SIAM, (2021)A 2n/2-Time Algorithm for $n$-SVP and $n$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP., , and . EUROCRYPT (1), volume 12696 of Lecture Notes in Computer Science, page 467-497. Springer, (2021)Improved Lower Bounds for 3-Query Matching Vector Codes., , , , and . Electron. Colloquium Comput. Complex., (2024)