Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, June 16, 2009, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Akitoshi Kawamura (Univ. of Toronto, Canada)
How complex could the solution be to an initial value problem (IVP) given by a polynomial-time computable function? Here, computational complexity of real functions is formulated in a natural and precise way that I will explain in the first half of the talk. I will then present my recent result (CCC 2009) showing, in answer to Ker-I Ko's question, that an IVP with the Lipschitz condition can have a polynomial-space complete solution.
Automatic MiSe System Software Version 1.4803M | admin login