Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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)

Computational Complexity of Ordinary Differential Equations

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login