( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A sharp threshold in proof complexity yields lower bounds for satisfiability search.

, , и . J. Comput. Syst. Sci., 68 (2): 238-268 (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.

S O Müller

Stephen Molloy

Michael -O Jung

Michael S Armstrong

Michael S Northcott

 

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

A sharp threshold in proof complexity yields lower bounds for satisfiability search., , и . J. Comput. Syst. Sci., 68 (2): 238-268 (2004)A sharp threshold in proof complexity., , и . STOC, стр. 337-346. ACM, (2001)(Delta-k)-critical graphs., , и . J. Comb. Theory, Ser. B, 93 (2): 173-185 (2005)On the mixing rate of the triangulation walk., , и . Randomization Methods in Algorithm Design, том 43 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 179-190. DIMACS/AMS, (1997)Sampling Grid Colorings with Fewer Colors., , , и . LATIN, том 2976 из Lecture Notes in Computer Science, стр. 80-89. Springer, (2004)Random Constraint Satisfaction: A More Accurate Picture., , , , , и . CP, том 1330 из Lecture Notes in Computer Science, стр. 107-120. Springer, (1997)Random Constraint Satisfaction: A More Accurate Picture., , , , , и . Constraints An Int. J., 6 (4): 329-344 (2001)The Analysis of a List-Coloring Algorithm on a Random Graph., и . FOCS, стр. 204-212. IEEE Computer Society, (1997)