( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A reducibility for the dot-depth hierarchy.

, и . Theor. Comput. Sci., 345 (2-3): 448-472 (2005)

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.

W Wagner

Klaus W Bielefeld

Klaus W Lange

Klaus W Hoffmann

Klaus W Müller

 

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

Eine Axiomatisierung der Theorie der regulären Folgenmengen.. Elektronische Informationsverarbeitung und Kybernetik, 12 (7): 337-354 (1976)Rekursive Folgenmengen I., и . Math. Log. Q., 24 (31-36): 523-538 (1978)The Complexity of Computing the Size of an Interval., , , и . SIAM J. Comput., 36 (5): 1264-1300 (2007)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)The Boolean Hierarchy of NP-Partitions., и . STACS, том 1770 из Lecture Notes in Computer Science, стр. 157-168. Springer, (2000)Complexity Hierarchies of Oracles., и . MFCS, том 53 из Lecture Notes in Computer Science, стр. 543-548. Springer, (1977)Arithmetic Circuits and Polynomial Replacement Systems., , и . FSTTCS, том 1974 из Lecture Notes in Computer Science, стр. 164-175. Springer, (2000)On Type-2 Probabilistic Quantifiers., , и . ICALP, том 1099 из Lecture Notes in Computer Science, стр. 369-380. Springer, (1996)The Boolean Hierarchy I: Structural Properties., , , , , , и . SIAM J. Comput., 17 (6): 1232-1252 (1988)The Complexity of Problems Defined by Boolean Circuits., и . Technical Report, 255. Department of Computer Science, (марта 2000)