Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform (Q4575600): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q4962665
 
description / endescription / en
 
scientific article; zbMATH DE number 6972825
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1446.94021 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/3029050 / rank
 
Normal rank
Property / published in
 
Property / published in: ACM Transactions on Algorithms / rank
 
Normal rank
Property / publication date
 
5 November 2018
Timestamp+2018-11-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 5 November 2018 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6972825 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2620883762 / rank
 
Normal rank
Property / zbMATH Keywords
 
sparse recovery
Property / zbMATH Keywords: sparse recovery / rank
 
Normal rank
Property / zbMATH Keywords
 
explicit constructions
Property / zbMATH Keywords: explicit constructions / rank
 
Normal rank
Property / zbMATH Keywords
 
pseudorandomness
Property / zbMATH Keywords: pseudorandomness / rank
 
Normal rank
Property / zbMATH Keywords
 
sketching
Property / zbMATH Keywords: sketching / rank
 
Normal rank
Property / zbMATH Keywords
 
sparse Fourier transform
Property / zbMATH Keywords: sparse Fourier transform / rank
 
Normal rank
Property / zbMATH Keywords
 
sublinear time algorithms
Property / zbMATH Keywords: sublinear time algorithms / rank
 
Normal rank

Latest revision as of 10:18, 6 May 2024

scientific article; zbMATH DE number 6972825
Language Label Description Also known as
English
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform
scientific article; zbMATH DE number 6972825

    Statements

    Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 July 2018
    0 references
    5 November 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    sparse recovery
    0 references
    explicit constructions
    0 references
    pseudorandomness
    0 references
    sketching
    0 references
    sparse Fourier transform
    0 references
    sublinear time algorithms
    0 references