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; zbMATH DE number 5940004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong I/O lower bounds for binomial and FFT computation graphs |
scientific article; zbMATH DE number 5940004 |
Statements
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs (English)
0 references
17 August 2011
0 references
0.7201351523399353
0 references
0.7192554473876953
0 references
0.7072310447692871
0 references
