Workshop on Circuit and Proof Complexity
1-7 October 2001, Edinburgh
Timetable page added on 25 September 2001. Click here.
Organisers:
J. Krajicek (Prague)
A. A. Razborov (Princeton/Moscow)
A. J. Wilkie (Oxford)
The emphasis of this Workshop will be on lower bounds in circuit and propositional proof complexity - a topic of basic importance in theoretical computer science and in mathematical logic.
Attendance at the Workshop is limited by the space available. There may be a few places remaining and anyone interested in taking part should approach Jan Krajicek (krajicek@math.cas.cz).
The meeting is supported by
The Engineering and Physical Sciences Research Council
This meeting's pages created 4 May 2001