Author of the publication

On Type-2 Probabilistic Quantifiers.

, , and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 369-380. Springer, (1996)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Arithmetic Circuits and Polynomial Replacement Systems., , and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 164-175. Springer, (2000)Complexity Hierarchies of Oracles., and . MFCS, volume 53 of Lecture Notes in Computer Science, page 543-548. Springer, (1977)The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems., and . STACS, volume 247 of Lecture Notes in Computer Science, page 100-113. Springer, (1987)On Type-2 Probabilistic Quantifiers., , and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 369-380. Springer, (1996)The Boolean Hierarchy of NP-Partitions., and . STACS, volume 1770 of Lecture Notes in Computer Science, page 157-168. Springer, (2000)New BCSV Theorem.. Technical Report, 337. Department of Computer Science, (August 2004)The Complexity of Disjoint Unions., , , and . Technical Report, 384. Department of Computer Science, (April 2006)The Analytic Polynomial Time Hierarchy., and . Technical Report, 148. Department of Computer Science, (September 1996)The Complexity of Problems Defined by Boolean Circuits., and . Technical Report, 255. Department of Computer Science, (March 2000)Bounding Queries in the Analytic Polynomial-Time Hierarchy., and . Technical Report, 178. Department of Computer Science, (August 1997)