ELFT HÍRADÓ

[ortvay AT achilles.elte.hu (Ortvay kollokvium)]

ELTE Fizika Intezet


                             ORTVAY KOLLOKVIUM

                   2008. november 20. , csutortok, 15 orakor
  Az ELTE Pazmany Peter s. 1/A alatti epuleteben a foldszinti 0.83 eloadoban

                             Katharina Anna Zweig 
                       (ELTE Biologiai Fizika Tanszek): 
             "Computational Complexity and Statistical Mechanics" 

Kivonatos ismertetes:

Computer scientists are most interested in the scalability of computational 
problems, their so-called computational complexity. A very important 
distinction is between problems that are solvable in polynomial time and 
those 
that need exponential time. But what exactly makes a problem difficult? In 
the 
last twenty years, physicists have applied methods from statistical mechanics 
to find out more about what makes a problem hard and they have used their 
knowledge to design better algorithms for hard problems. This talk summarizes 
the current research in this interdisciplinary field. 

Minden erdeklodot szivesen latunk! Az eloadas elott negyed oraval 
az eloadoban teat szolgalunk fel.
Az eloadas-sorozatrol az interneten az "ortvay-koll.elte.hu" cimen 
talalhato informacio.