Programming with divide-and-conquer skeletons: A case study of FFT (Q1386455)
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: Programming with divide-and-conquer skeletons: A case study of FFT |
scientific article; zbMATH DE number 1154605
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Programming with divide-and-conquer skeletons: A case study of FFT |
scientific article; zbMATH DE number 1154605 |
Statements
Programming with divide-and-conquer skeletons: A case study of FFT (English)
0 references
24 May 1998
0 references
distributable homomorphism
0 references
skeletons
0 references
