( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Proof complexity.

. Computational Complexity Theory, том 10 из IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)

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.

Tanja Beament

Manfred Paul

Manfred Paul

Erich Friedrich Paulus

Wolfgang Paul

 

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

Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube., и . CoRR, (2016)Counting of Query Expressions: Limitations of Propositional Methods., , , и . ICDT, стр. 177-188. OpenProceedings.org, (2014)Optimizing symbolic model checking for statecharts, , , , , и . Software Engineering, IEEE Transactions on, 27 (2): 170--190 (2001)Proof complexity.. Computational Complexity Theory, том 10 из IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems., и . STOC, стр. 688-697. ACM, (2002)Optimal Bounds for the Predecessor Problem., и . STOC, стр. 295-304. ACM, (1999)Distributed Computing on TRansitive Networks: The Thorus., и . STACS, том 349 из Lecture Notes in Computer Science, стр. 294-303. Springer, (1989)A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata., , , , и . SIAM J. Comput., 28 (3): 1051-1072 (1999)A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness., , , и . Comput. Complex., 15 (4): 391-432 (2006)Optimal bounds for decision problems on the CRCW PRAM., и . J. ACM, 36 (3): 643-670 (1989)