|
Size: 520
Comment:
|
Size: 658
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 25: | Line 25: |
| * Charles Doran (June 17) | * Charles Doran (June 17 at 11am) |
| Line 31: | Line 31: |
| * Paule Beame (June 16) | * Paul Beame (June 16 at 3pm): ''Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.'' |
Daily schedule
Schedule for [:days4: SAGE Days 4].
9-12: (optional) early-bird coffee, bagels, etc.
12-1 lunch at a designated restaurant
1:30 - 2:30 talk on improvements made to SAGE
3:00 - 4:00 talk on what SAGE needs in order to improve
4:30 - 5:00 strategy session
5:00 - 7:00 coding sprints
7:00 - 9:00 dinner
9:00 - very late: coding sprints
Talks
- Sarah Billey (TBA)
- Charles Doran (June 17 at 11am)
- Randy Leveque (TBA)
- Jim Morrow
Paul Beame (June 16 at 3pm): Proof complexity involving semi-algebraic sets and lift and project problems for linear and semi-definite programming.