( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
What one has to know when attacking P vs. NP.

, и . J. Comput. Syst. Sci., (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.

Peter Rossmanith

Peter Rossmanith

Peter Rossmanith

Peter Rossmanith

Manfred Rossmanith

 

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

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs., , , , , и . J. Comput. Syst. Sci., (2019)Advice for Online Knapsack With Removable Items., , , и . CoRR, (2020)Corrigendum: Decoding neuropathic pain: Can we predict fluctuations of propagation speed in stimulated peripheral nerve?, , , , , и . Frontiers Comput. Neurosci., (февраля 2023)Moderately exponential time algorithms for the maximum bounded-degree-1 set problem., , , , , и . Discret. Appl. Math., (2018)The Secretary Problem with Reservation Costs., , , , и . COCOON, том 13025 из Lecture Notes in Computer Science, стр. 553-564. Springer, (2021)Online Simple Knapsack with Bounded Predictions., , и . STACS, том 289 из LIPIcs, стр. 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Online Knapsack with Removal and Recourse., , , , , и . IWOCA, том 13889 из Lecture Notes in Computer Science, стр. 123-135. Springer, (2023)The owner concept for PRAMs. Forschungsberichte, TU Munich, (1990)Online Simple Knapsack with Reservation Costs., , , , и . CoRR, (2020)What one has to know when attacking P vs. NP., и . J. Comput. Syst. Sci., (2020)