Phase transitions in combinatorial problemsDUBOIS, O; MONASSON, R; SELMAN, B et al.Theoretical computer science. 2001, Vol 265, Num 1-2, issn 0304-3975, 309 p.Serial Issue

Rigorous results for random (2 + p)-SATACHLIOPTAS, Dimitris; KIROUSIS, Lefteris M; KRANAKIS, Evangelos et al.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 109-129, issn 0304-3975Article

Frozen development in graph coloringCULBERSON, Joseph; GENT, Ian.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 227-264, issn 0304-3975Article

Random 2-SAT: results and problemsFERNANDEZ DE LA VEGA, W.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 131-146, issn 0304-3975Article

Complexity of learning in artificial neural networksENGEL, Andreas.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 285-306, issn 0304-3975Article

Upper bounds on the satisfiability thresholdDUBOIS, Olivier.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 187-197, issn 0304-3975Article

A physicist's approach to number partitioningMERTENS, Stephan.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 79-108, issn 0304-3975Article

Lower bounds for random 3-SAT via differential equationsACHLIOPTAS, Dimitris.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 159-185, issn 0304-3975Article

Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphsHARTMANN, Alexander K; WEIGT, Martin.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 199-225, issn 0304-3975Article

Statistical mechanics methods and phase transitions in optimization problemsMARTIN, Olivier C; MONASSON, Rémi; ZECCHINA, Riccardo et al.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 3-67, issn 0304-3975Article

Constructing an asymptotic phase transition in random binary constraint satisfaction problemsSMITH, Barbara M.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 265-283, issn 0304-3975Article

Rigorous results for mean field models for spin glassesTALAGRAND, Michel.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 69-77, issn 0304-3975Article

Results related to threshold phenomena research in satisfiability : lower boundsFRANCO, John.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 147-157, issn 0304-3975Article