Home /  Workshop /  Schedules /  Bounds and algorithms for polynomial rings over the integers

Bounds and algorithms for polynomial rings over the integers

Computational Commutative Algebra March 13, 2003 - March 15, 2003

March 13, 2003 (10:30 AM PST - 11:20 AM PST)
Speaker(s): Matthias Aschenbrenner (University of California, Los Angeles)
Location: SLMath: Eisenbud Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

10150

200-1086-Bounds and algorithms for polynomial rings over the integers-Matthias Aschenbrenner
Abstract No Abstract Uploaded
Supplements
Asset no preview aschenbrenner.pdf 115 KB application/pdf Download
Video/Audio Files

10150

Audio 10150-10150-DVD PCM Audio.aiff 569 MB audio/x-aiff Download
DVD Video 10150-10150-MPEG-2 120min High Quality Encode.m2v 1.27 GB video/mpeg Download
Quicktime 10150-10150-QuickTime.mov 385 MB video/quicktime rtsp://videos.msri.org/10150/10150-10150-QuickTime.mov Download
H.264 Video 10150-10150.mp4 321 MB video/mp4 Download

200-1086-Bounds and algorithms for polynomial rings over the integers-Matthias Aschenbrenner

H.264 Video 200-1086-Bounds_and_algorithms_for_polynomial_rings_over_the_integers-Matthias_Aschenbrenner.mp4 51.1 MB video/mp4 Download
200-1086-Bounds_and_algorithms_for_polynomial_rings_over_the_integers-Matthias_Aschenbrenner.rm 17.1 MB application/vnd.rn-realmedia Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.