( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computational Complexity

. Addison-Wesley, Reading, MA, (1994)

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.

Evripidis Papadimitriou

Georg Papadimitriou

Sofia Papadimitriou

Joannis Papadimitriou

Dimitra Papadimitriou

 

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

Understanding the Internet.. SETN, том 2308 из Lecture Notes in Computer Science, стр. 1-2. Springer, (2002)On the approximability of the traveling salesman problem (extended abstract)., и . STOC, стр. 126-133. ACM, (2000)The complexity of searching a graph., , , , и . J. ACM, 35 (1): 18-44 (1988)Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria., , , и . ITCS, том 151 из LIPIcs, стр. 18:1-18:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Incremental Recompilation of Knowledge, , и . CoRR, (1998)Covering Graphs by Simple Circuits., , , и . SIAM J. Comput., 10 (4): 746-750 (1981)Scheduling Interval-Ordered Tasks., и . SIAM J. Comput., 8 (3): 405-409 (1979)The Optimum Execution Order of Queries in Linear Storage., , и . Inf. Process. Lett., 36 (3): 141-145 (1990)An Algorithm for Shortest-Path Motion in Three Dimensions.. Inf. Process. Lett., 20 (5): 259-263 (1985)The Complexity of Reliable Concurrency Control., и . SIAM J. Comput., 16 (3): 538-553 (1987)