Image de couverture de livre

Fast algorithms for complex-valued discrete Fourier transform with separate real and imaginary inputs/outputs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Cariow, Aleksandr
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms 65T50
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

An inexact augmented Lagrangian algorithm for unsymmetric saddle-point systems
par: Huang, N., et autres
Publié: (2024)

Precision Arithmetic: A New Floating-Point Arithmetic
par: Wang, Chengpu
Publié: (2006)

A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
par: Guidotti, Nicolas L., et autres
Publié: (2023)

Nonlinear transformation of complex amplitudes via quantum singular value transformation
par: Guo, Naixu, et autres
Publié: (2021)

Fast exact algorithms via the Matrix Tree Theorem
par: Arvind, V., et autres
Publié: (2025)

Did Fourier Really Meet Möbius? Fast Subset Convolution via FFT
par: Stoian, Mihail
Publié: (2024)

Debiasing Polynomial and Fourier Regression
par: Camaño, Chris, et autres
Publié: (2025)

Fast Leaf-to-Ancestor Minimum Query in the Oracle Model
par: Upirvitskiy, Aleksey, et autres
Publié: (2026)

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
par: Chakraborty, Shantanav, et autres
Publié: (2025)

Fast approximation algorithms for the 1-median problem on real-world large graphs
par: Ueta, Keisuke, et autres
Publié: (2025)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
par: Alman, Josh, et autres
Publié: (2025)

Accelerating ERM for data-driven algorithm design using output-sensitive techniques
par: Balcan, Maria-Florina, et autres
Publié: (2022)

Deterministic complexity analysis of Hermitian eigenproblems
par: Sobczyk, Aleksandros
Publié: (2024)

Optimization with pattern-avoiding input
par: Berendsohn, Benjamin Aram, et autres
Publié: (2023)

The clustered Sparrow algorithm
par: Dumitrescu, Cristian
Publié: (2018)

Fast algorithms for least square problems with Kronecker lower subsets
par: Malik, Osman Asif, et autres
Publié: (2022)

Fast algorithms for classical specifications of stabiliser states and Clifford gates
par: de Silva, Nadish, et autres
Publié: (2023)

Superfast direct inversion of the nonuniform discrete Fourier transform via hierarchically semi-separable least squares
par: Wilber, Heather, et autres
Publié: (2024)

Streaming algorithms for products of probabilities
par: Lohrey, Markus, et autres
Publié: (2025)

Parameterized algorithms for $k$-Inversion
par: Antony, Dhanyamol, et autres
Publié: (2026)

A practical algorithm for 3-admissibility
par: Awofeso, Christine, et autres
Publié: (2025)

New algorithms for girth and cycle detection
par: Roditty, Liam, et autres
Publié: (2025)

Engineering Semi-streaming DFS algorithms
par: Bhagavan, Kancharla Nikhilesh, et autres
Publié: (2024)

Insights into $(k,ρ)$-shortcutting algorithms
par: Leonhardt, Alexander, et autres
Publié: (2024)

Practical algorithms for Hierarchical overlap graphs
par: Talera, Saumya, et autres
Publié: (2024)

Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
par: Flouro, Aaron R., et autres
Publié: (2026)

Fast Similarity Sketching
par: Dahlgaard, Søren, et autres
Publié: (2017)

GridOT -- a discrete optimal transport solver on grids
par: Rauch, Johannes, et autres
Publié: (2025)

Quantum algorithm for approximating the expected value of a random-exist quantified oracle
par: Rotello, Caleb
Publié: (2024)

Strassen's algorithm via orbit flip graphs
par: Ikenmeyer, Christian, et autres
Publié: (2025)

Faster parameterized algorithm for 3-Hitting Set
par: Tsur, Dekel
Publié: (2025)

An FPT algorithm for Matching Cut and d-cut
par: Aravind, N R, et autres
Publié: (2021)

Optimal bounds on a tree inference algorithm
par: Gardiner, Jack, et autres
Publié: (2024)

Fast In-Spectrum Graph Watermarks
par: Bourrée, Jade Garcia, et autres
Publié: (2025)

Fast Approximate Counting of Cycles
par: Censor-Hillel, Keren, et autres
Publié: (2024)

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
par: Yang, Yang
Publié: (2024)

Faster algorithms for k-Orthogonal Vectors in low dimension
par: Dürr, Anita, et autres
Publié: (2025)

New simple and fast quicksort algorithm for equal keys
par: Afereidoon, Parviz
Publié: (2025)

Efficient algorithm for linear diophantine equations in two variables
par: Deora, Mayank, et autres
Publié: (2025)

Parallel batch queries on dynamic trees: algorithms and experiments
par: Ikram, Humza, et autres
Publié: (2025)