Strong I/O Lower Bounds for Binomial and FFT Computation Graphs (Q3087945)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strong I/O Lower Bounds for Binomial and FFT Computation Graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong I/O Lower Bounds for Binomial and FFT Computation Graphs |
scientific article |
Statements
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs (English)
0 references
17 August 2011
0 references
