Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with fourier-transform
Search options answers only
not deleted
user 755
0
votes
Morgenstern proof for FFT lower bound
Morganstern's original paper is here:
Jacques Morgenstern. Note on a lower bound on the linear complexity of the fast Fourier transform. J. ACM, 20(2):305–306, April 1973.
D.W.♦
- 166k
1
vote
Could an NP-Hard problem be in P in after a basis transform?
Could a problem we think is NP-hard actually be solvable in polytime? Sure. We could be wrong (we suspected/guessed it was NP-hard, but our suspicion/guess was wrong). Or, it could be NP-hard and s …
D.W.♦
- 166k
0
votes
Accepted
Efficiently compute parallel matrix-vector product for block vectors with FFTs?
Let's look at the case where $P=2$, for starters. The FFT can be computed in a divide-and-conquer fashion, where first we compute the FFT of the even-numbered indices, then the FFT of the odd-numbere …
D.W.♦
- 166k