The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7306053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform |
scientific article; zbMATH DE number 7306053 |
Statements
The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (English)
0 references
4 February 2021
0 references
computational complexity
0 references
theory of computation
0 references
Fourier transform complexity
0 references
0 references
0.7570963501930237
0 references
0.7444344162940979
0 references
0.7397960424423218
0 references
0.7192172408103943
0 references
