DIFFERENT APPROACHES TO COMPLEXITY IN MATHEMATICS

AND MATHEMATICAL PHYSICS

JUNE 12-19 2007

TECHNION, HAIFA, ISRAEL

In memory of Bella Subbotovskaya

_{Courtesy of Ilya Muchnik}

_{Picture quality improved by Poline Tylevich}

The goal of the conference is to bring together researchers studying various forms of complexity (in the most general sense of this notion and not only the algorithmic complexity) in mathematics and mathematical physics. In memory of Bella Subbotovskaya, a mathematician who worked in the algorithmic complexity theory and an unknown hero of Soviet mathematics.

LIST OF PARTICIPANTS:

N.Alon (Tel-Aviv U.), D.Fuchs (U. of California at Davis), V.L.Ginzburg (U. of California at Santa Cruz), J. Hass (U. of California at Davis), A.Kanel-Belov (Bar Ilan U.), Y.Kifer (Hebrew U.), M.Krivelevich (Tel Aviv U.), L.Levitov (MIT), F.Malikov (U. of Southern California), S.Matveev (Chelyabinsk State U.), A.Nabutovsky (Pennsylvania State U. and U. of Toronto), L.Potyagailo (U. de Lille), A.Reznikov (Bar-Ilan U.), L. Rozansky (U. of North Carolina at Chapel Hill), M.Sapir (Vanderbilt U.), B. Shapiro (Stockholm U.), A.Shen (U. de Marseille and Independent U. of Moscow), M.Shiffman (U. of Minnesota at Minneapolis), M.Sodin (Tel Aviv U.), S.Tabachnikov (Pennsylvania State U.), A.Vainshtein (U. of Haifa), A. Vinogradov (U. di Salerno), S. Weinberger (U. of Chicago), S.Yakovenko (Weizmann Inst.), S.Zelditch (John Hopkins U.).

Program

Abstracts

Airport arrival: