The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform
scientific article

    Statements

    The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (English)
    0 references
    0 references
    0 references
    4 February 2021
    0 references
    computational complexity
    0 references
    theory of computation
    0 references
    Fourier transform complexity
    0 references

    Identifiers