1043
Comment:

1088

Deletions are marked like this.  Additions are marked like this. 
Line 14:  Line 14: 
= Talks = 
= Colloquium Talks = 
Line 17:  Line 16: 
* David Harvey (Harvard Math): '''FLINT and Fast Polynomial Arithmetic'''  
Line 20:  Line 18: 
* Charles Doran (UW Math, June 17 at 11am)  * Charles Doran (UW Math, June 17 at 11am): TBA 
Line 22:  Line 20: 
* Jim Morrow (UW Math): Graph theory and electrical networks. * Paul Beame (UW Computer Science, June 16 at 3pm): ''Proof complexity involving semialgebraic sets and lift and project problems for linear and semidefinite programming.'' 
* Jim Morrow (UW Math): '''Graph theory and electrical networks.''' * Paul Beame (UW Computer Science, June 16 at 3pm): '''Proof complexity involving semialgebraic sets and lift and project problems for linear and semidefinite programming.''' = Developer Talks = * David Harvey (Harvard Math): '''FLINT and Fast Polynomial Arithmetic''' 
Daily schedule
Schedule for [:days4: SAGE Days 4].
 912: (optional) earlybird coffee, bagels, etc.
 121 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
Colloquium Talks
William Stein (UW Math): State of the SAGE project
 Sarah Billey (UW Math): TBA
 Henry Cohn (Microsoft Research, June 13): TBA
 Charles Doran (UW Math, June 17 at 11am): TBA
 Randy Leveque (UW Applied Math): TBA
Jim Morrow (UW Math): Graph theory and electrical networks.
Paul Beame (UW Computer Science, June 16 at 3pm): Proof complexity involving semialgebraic sets and lift and project problems for linear and semidefinite programming.
Developer Talks
David Harvey (Harvard Math): FLINT and Fast Polynomial Arithmetic
Carl Witty (Newton Research Labs, June 16): Fast real root isolation (tentative)