We prove a result displaying a connection between the existence of a phase transition in combinatorial problems and the complexity of decision algorithms. Specifically, for the class of generalized random satisfiability problems we prove that a discontinuity in a variant (called spine) of the order parameter used in the study of phase transitions in such problems is accompanied by an exponential lower bound on the complexity of resolution proofs

http://dbs.cordis.lu/fep-cgi/srchidadb?ACTION=D&SESSION=51462004-3-29&DOC=14&TBL=EN_NEWS&RCN=EN_RCN_ID:21756&CALLER=FP6_NEWS

http://www.ipam.ucla.edu/programs/rips2004 Programul nu are restrictii legate de cetatenie, studii, etc.

http://www.capital.ro/index.php?IdOfArticle=5863&view=detail

http://omicron.ch.tuiasi.ro/iceem/

http://users.utcluj.ro/~aqtr2002/

http://www.utt.ro/pfhd/

http://faraday.ee.utt.ro/html/simpozion2002.htm

(from RGMIA mailing list) The 5th ROmanian-GERman Seminar on Approximation Theory is hosted by the Romanian German University of Sibiu between July 11-14, 2002. The aim of the Seminar is to bring up some unsolved and open problems from the fields of Constructive Function Theory, Approximation Theory, Numerical Analysis and Special Functions. Further information and registration (until May 5) can be obtained from Professor Dr. Alexandru Lupas, Romanian-German

EXYSTENCE THEMATIC INSTITUTE: call for applications The European Communities are proposing to finance the activities of the Complex Systems Network of Excellence (EXYSTENCE). The purpose of EXYSTENCE is to develop collaboration among European research scientists interested in Complex Systems from fundamental concepts to applications, and involving academia, business and industry. The Network will not start earlier than April 2002, but advance notice