Tighter Fourier Transform Lower Bounds (Q3448770)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Tighter Fourier Transform Lower Bounds	scientific article

Statements

scholarly article

0 references

Tighter Fourier Transform Lower Bounds (English)

0 references

0 references

Automata, Languages, and Programming

0 references

publication date

27 October 2015

0 references

full work available at URL

https://arxiv.org/abs/1404.1741

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Tighter Fourier Transform Lower Bounds

0 references

The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors

0 references

Fast dimension reduction using Rademacher series on dual BCH codes

0 references

An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform

0 references

Fast and RIP-optimal transforms

0 references

An Algorithm for the Machine Calculation of Complex Fourier Series

0 references

0 references

Fast Integer Multiplication Using Modular Arithmetic

0 references

Faster Integer Multiplication

0 references

Even faster integer multiplication

0 references

(Nearly) Sample-Optimal Sparse Fourier Transform

0 references

New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property

0 references

Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

0 references

Optimality of the Fast Fourier transform

0 references

Sampling from large matrices

0 references

On computing the Discrete Fourier Transform

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-47672-7_2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3448770

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3448770&oldid=36208692"