( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lower Bounds for Elimination via Weak Regularity.

, , , , и . STACS, том 66 из LIPIcs, стр. 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Detmar Loff

Steffan Loff

Peter Loff

Horst Bruno

Horst Bruno

 

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

Derandomizing from Random Strings, , , и . CoRR, (2009)Simulation Theorems via Pseudorandom Properties., , , и . CoRR, (2017)On the Complexity of Measurement in Classical Physics., , , и . TAMC, том 4978 из Lecture Notes in Computer Science, стр. 20-30. Springer, (2008)Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy., , , , и . CCC, том 300 из LIPIcs, стр. 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Reductions to the Set of Random Strings: The Resource-Bounded Case., , , и . MFCS, том 7464 из Lecture Notes in Computer Science, стр. 88-99. Springer, (2012)Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks., , , и . CoRR, (2021)Derandomizing from Random Strings., , , и . CCC, стр. 58-63. IEEE Computer Society, (2010)Towards a Reverse Newman's Theorem in Interactive Information Complexity., , , , , и . CCC, стр. 24-33. IEEE Computer Society, (2013)Lower Bounds for Elimination via Weak Regularity., , , , и . STACS, том 66 из LIPIcs, стр. 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Memory Compression with Quantum Random-Access Gates., , , и . TQC, том 232 из LIPIcs, стр. 10:1-10:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)