( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Probabilistic Polynomial Time is Closed under Parity Reductions.

, , и . 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.

Arwed Beigel

Max Beigel

Arwed Beigel

Anton Beigel

Dörte Beigel

 

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

Gaps in Bounded Query Hierarchies. Electron. Colloquium Comput. Complex., (1998)On Being Incoherent Without Being Very Hard., и . Comput. Complex., (1992)Terse, Superterse, and Verbose Sets, , , и . Inf. Comput., 103 (1): 68-85 (марта 1993)Design and Evaluation of Incremental Data Structures and Algorithms for Dynamic Query Interfaces., , и . INFOVIS, стр. 81-86. IEEE Computer Society, (1997)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)Approximable Sets., , и . SCT, стр. 12-23. IEEE Computer Society, (1994)Downward separation fails catastrophically for limited nondeterminism classes., и . SCT, стр. 134-138. IEEE Computer Society, (1994)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)Enumerations of the Kolmogorov function., , , , , , , , и . J. Symb. Log., 71 (2): 501-528 (2006)