Tighter Fourier Transform Lower Bounds (Q3448770): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W822096598 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.1741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Fourier Transform Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast dimension reduction using Rademacher series on dual BCH codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and RIP-optimal transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Integer Multiplication Using Modular Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Integer Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even faster integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Nearly) Sample-Optimal Sparse Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of the Fast Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling from large matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the Discrete Fourier Transform / rank
 
Normal rank

Latest revision as of 22:46, 10 July 2024

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

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references