Author of the publication

Lower Bound Methods for Sign-Rank and Their Limitations.

, , , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 22:1-22:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

 

Other publications of authors with the same name

Intersection Classes in TFNP and Proof Complexity., , and . ITCS, volume 287 of LIPIcs, page 74:1-74:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On public-coin zero-error randomized communication complexity., , , , and . Inf. Process. Lett., (2022)Dynamic resources allocation in non-3GPP IoT networks involving UAVs., , , , and . VTC2023-Spring, page 1-5. IEEE, (2023)Further Collapses in TFNP., , , , , , and . CCC, volume 234 of LIPIcs, page 33:1-33:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On public-coin zero-error randomized communication complexity., , , , and . Electron. Colloquium Comput. Complex., (2021)Bi-objective Optimization for Energy Efficiency and Centralization Level in Virtualized RAN., , , , , and . ICC, page 1034-1039. IEEE, (2022)Separations in Proof Complexity and TFNP., , , , , , and . FOCS, page 1150-1161. IEEE, (2022)Lower Bound Methods for Sign-Rank and Their Limitations., , , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 22:1-22:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)