Computing lower bounds for a polynomial using geometric programming
Duration: 32 mins 2 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Marshall, MA (University of Saskatchewan)
Wednesday 17 July 2013, 15:00-15:30 |
|---|
| Created: | 2013-07-22 09:51 |
|---|---|
| Collection: | Polynomial Optimisation |
| Publisher: | Isaac Newton Institute |
| Copyright: | Marshall, MA |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 464.60 MB | View | Download | |
| WebM | 640x360 | 815.17 kbits/sec | 191.26 MB | View | Download | |
| iPod Video | 480x270 | 521.98 kbits/sec | 122.47 MB | View | Download | |
| MP3 | 44100 Hz | 249.83 kbits/sec | 58.65 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||