| 9h15-10h15 |
Descriptive Complexity and Lower Bounds | T. Schwentick, Mainz |
|---|---|---|
| 10h15-10h45 |
Are lower bounds easier on the reals? | Pascal KOIRAN, Lyon |
| 10h45-11h15 |
Pause | |
| 11h15-11h45 |
Efficient approximation algorithms for the \\[0,7 em] sum of subsets problem | C. Bazgan, Orsay |
| 11h45-12h15 |
Complexity of term rewritin g theory | Helene Touzet, Nancy |
| 14h-14h30 |
La construction d'un dessin planaire d'un graphe en logique du second-ordre monadique | Bruno COURCELLE, Bordeaux |
|---|---|---|
| 14h30-15h |
Expression of graph properties by unary functions | Solomampionona RANAIVOSON, Caen |
| 15h-15h30 |
Une axiomatisation au premier ordre des pseudo-droites | B. Courcelle et F. Olive |
| 15h30-16h |
Pause, Appartement decanal | |
| 16h- 16h30 |
On counting $AC^0$ circuit with negative constants | LeThanh Huong, SANTHA Miklos, Orsay |
| 16h30-17h |
Very ramified recurrence with substitution and Alogtime | Jean-Yves Marion, Nancy |
| 17h-17h30 |
Testeurs exacts et approche's | Frederic Magniez, Orsay |
| 9h-10h |
Towards a logic for polynomial time | M. Grohe, Freiburg |
|---|---|---|
| 10h-10h30 |
Querying Spatial Data bases via Topological Invariants | L. Segoufin, INRIA |
| 10h30-11h |
Transformations of constrained logic programs | Nacera Bensaou, Paris |
| 11h-11h30 |
Pause | |
| 11h30-12h |
Integrity constraints, updates in relational and deductive databases | A. Ait-Bouziad, I. Guessarian, Paris |
| 12h-12h30 |
Hierarchies of counting problems | Avy Sharell, Orsay |