( en | de | ru )

 

Disambiguation of "Beigel, Richard"

Author of the publication

copydeleteadd this publication to your clipboard
Probabilistic Polynomial Time is Closed under Parity Reductions.

, , and . Inf. Process. Lett., 37 (2): 91-94 (1991)

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.

Arwed Beigel

Max Beigel

Arwed Beigel

Anton Beigel

Dörte Beigel

 

Other publications of authors with the same name

PP Is Closed Under Intersection (Extended Abstract), , and . STOC, page 1-9. ACM, (1991)Design and Evaluation of Incremental Data Structures and Algorithms for Dynamic Query Interfaces., , and . INFOVIS, page 81-86. IEEE Computer Society, (1997)On Being Incoherent Without Being Very Hard., and . Comput. Complex., (1992)Gaps in Bounded Query Hierarchies. Electron. Colloquium Comput. Complex., (1998)Infinitely-Often Autoreducible Sets., , and . ISAAC, volume 2906 of Lecture Notes in Computer Science, page 98-107. Springer, (2003)Terse, Superterse, and Verbose Sets, , , and . Inf. Comput., 103 (1): 68-85 (March 1993)On molecular approximation algorithms for NP optimization problem., and . DNA Based Computers, volume 48 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 207-216. DIMACS/AMS, (1997)Approximable Sets., , and . SCT, page 12-23. IEEE Computer Society, (1994)Downward separation fails catastrophically for limited nondeterminism classes., and . SCT, page 134-138. IEEE Computer Society, (1994)Die Sprache der Maschinen., and . Informatik Lehrbuch-Reihe International Thomson, (1996)