Theoretical Computer Science, Volume 265

Volume 265, Number 1-2, August 2001

• Olivier Dubois, Rémi Monasson, Bart Selman, Riccardo Zecchina:
  Editorial. 1
  
• Olivier C. Martin, Rémi Monasson, Riccardo Zecchina:
  Statistical mechanics methods and phase transitions in optimization problems. 3-67
  
• Michel Talagrand:
  Rigorous results for mean field models for spin glasses. 69-77
  
• Stephan Mertens:
  A physicist's approach to number partitioning. 79-108
  
• Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc:
  Rigorous results for random (2+p)-SAT. 109-129
  
• Wenceslas Fernandez de la Vega:
  Random 2-SAT: results and problems. 131-146
  
• John V. Franco:
  Results related to threshold phenomena research in satisfiability: lower bounds. 147-157
  
• Dimitris Achlioptas:
  Lower bounds for random 3-SAT via differential equations. 159-185
  
• Olivier Dubois:
  Upper bounds on the satisfiability threshold. 187-197
  
• Alexander K. Hartmann, Martin Weigt:
  Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs. 199-225
  
• Joseph C. Culberson, Ian P. Gent:
  Frozen development in graph coloring. 227-264
  
• Barbara M. Smith:
  Constructing an asymptotic phase transition in random binary constraint satisfaction problems. 265-283
  
• Andreas Engel:
  Complexity of learning in artificial neural networks. 285-306