Generalized fullerene-like lattices, and itinerant interacting electronsRASETTI, M; ZECCHINA, R.Physica. A. 1993, Vol 199, Num 3-4, pp 539-570, issn 0378-4371Article

Upper bounds on the satisfiability thresholdDUBOIS, Olivier.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 187-197, 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

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

A ferromagnet with a glass transitionFRANZ, S; MEZARD, M; RICCI-TERSENGHI, F et al.Europhysics letters (Print). 2001, Vol 55, Num 4, pp 465-471, issn 0295-5075Article

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

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

Determining computational complexity from characteristic 'phase transitions'MONASSON, R; ZECCHINA, R; KIRKPATRICK, S et al.Nature (London). 1999, Vol 400, Num 6740, pp 133-137, issn 0028-0836Article

Analytic and algorithmic solution of random satisfiability problemsMEZARD, M; PARISI, G; ZECCHINA, R et al.Science (Washington, D.C.). 2002, Vol 297, Num 5582, pp 812-815, issn 0036-8075Article

A physicist's approach to number partitioningMERTENS, Stephan.Theoretical computer science. 2001, Vol 265, Num 1-2, pp 79-108, 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

Statistical physics approach to graphical games: local and global interactionsRAMEZANPOUR, A; REALPE-GOMEZ, J; ZECCHINA, R et al.The European physical journal. B, Condensed matter physics (Print). 2011, Vol 81, Num 3, pp 327-339, issn 1434-6028, 13 p.Article

Clustering of solutions in the random satisfiability problemMEZARD, M; MORA, T; ZECCHINA, R et al.Physical review letters. 2005, Vol 94, Num 19, pp 197205.1-197205.4, issn 0031-9007Article

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

Symmetry breaking in non-monotonic neural networksBOFFETTA, G; MONASSON, R; ZECCHINA, R et al.Journal of physics. A, mathematical and general. 1993, Vol 26, Num 12, pp L507-L513, issn 0305-4470Article