From post

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.

 

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

On Being Incoherent Without Being Very Hard., и . Comput. Complex., (1992)On molecular approximation algorithms for NP optimization problem., и . DNA Based Computers, том 48 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 207-216. DIMACS/AMS, (1997)Approximable Sets., , и . SCT, стр. 12-23. IEEE Computer Society, (1994)Downward separation fails catastrophically for limited nondeterminism classes., и . SCT, стр. 134-138. IEEE Computer Society, (1994)PP Is Closed Under Intersection (Extended Abstract), , и . STOC, стр. 1-9. ACM, (1991)Infinitely-Often Autoreducible Sets., , и . ISAAC, том 2906 из Lecture Notes in Computer Science, стр. 98-107. Springer, (2003)Design and Evaluation of Incremental Data Structures and Algorithms for Dynamic Query Interfaces., , и . INFOVIS, стр. 81-86. IEEE Computer Society, (1997)One Help Bit Doesn't Help., и . STOC, стр. 124-130. ACM, (1998)On ACC., и . Comput. Complex., (1994)Perceptrons, PP, and the Polynomial Hierarchy.. Comput. Complex., (1994)