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.

 

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

Complexity Hierarchies of Oracles., и . MFCS, том 53 из Lecture Notes in Computer Science, стр. 543-548. Springer, (1977)The Boolean Hierarchy of NP-Partitions., и . STACS, том 1770 из Lecture Notes in Computer Science, стр. 157-168. Springer, (2000)The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems., и . STACS, том 247 из Lecture Notes in Computer Science, стр. 100-113. Springer, (1987)On Type-2 Probabilistic Quantifiers., , и . ICALP, том 1099 из Lecture Notes in Computer Science, стр. 369-380. Springer, (1996)The Complexity of Problems Defined by Boolean Circuits., и . Technical Report, 255. Department of Computer Science, (марта 2000)The Analytic Polynomial Time Hierarchy., и . Technical Report, 148. Department of Computer Science, (сентября 1996)Bounding Queries in the Analytic Polynomial-Time Hierarchy., и . Technical Report, 178. Department of Computer Science, (августа 1997)Classes of counting functions and complexity theoretic operators., и . Technical Report, 31. Department of Computer Science, (августа 1991)Vector language: Simple description of hard instances., и . Technical Report, 46. Department of Computer Science, (октября 1992)New BCSV Theorem.. Technical Report, 337. Department of Computer Science, (августа 2004)