Imagen de Portada

Deterministic Sparse FFT via Keyed Multi-View Gating with $O(\sqrt{N} \log k)$ Expected Time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Flouro, Aaron R., Chadwick, Shawn P.
Formato:	Preprint
Publicado:	2026
Materias:	Signal Processing Data Structures and Algorithms Information Theory 68W40, 94A12 F.2.2; G.4
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

The Quasi-probability Method and Applications for Trace Reconstruction
por: Rubinstein, Ittai
Publicado: (2024)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
por: Sopp, Braeden, et al.
Publicado: (2026)

NP-membership for the boundary-boundary art-gallery problem
por: Stade, Jack
Publicado: (2025)

Fairness in the k-Server Problem
por: Daneshvaramoli, Mohammadreza, et al.
Publicado: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
por: Chen, Zongchen, et al.
Publicado: (2022)

String 2-Covers with No Length Restrictions
por: Boneh, Itai, et al.
Publicado: (2024)

Fast FPT Algorithms for Grundy Number on Dense Graphs
por: Nezhad, Sina Ghasemi, et al.
Publicado: (2024)

Minimum-cost paths for electric cars
por: Dorfman, Dani, et al.
Publicado: (2024)

Hairpin Completion Distance Lower Bound
por: Boneh, Itai, et al.
Publicado: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
por: An, Hyung-Chan, et al.
Publicado: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
por: Filmus, Yuval, et al.
Publicado: (2024)

Maximizing Diversity in (near-)Median String Selection
por: Chakraborty, Diptarka, et al.
Publicado: (2026)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
por: Crochemore, Maxime, et al.
Publicado: (2025)

PPSZ is better than you think
por: Scheder, Dominik
Publicado: (2022)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
por: Zhong, Xianghui
Publicado: (2019)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
por: Heimann, Sophia, et al.
Publicado: (2024)

Naively Sorting Evolving Data is Optimal and Robust
por: Giakkoupis, George, et al.
Publicado: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

Computing Maximal Repeating Subsequences in a String
por: Gong, Mingyang, et al.
Publicado: (2026)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
por: Sun, Hao
Publicado: (2023)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
por: Shigemizu, Mika, et al.
Publicado: (2018)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
por: Buchbinder, Niv, et al.
Publicado: (2024)

Searching in trees with monotonic query times
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
por: Hougardy, Stefan, et al.
Publicado: (2025)

How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025)

Sparse Knowledge Distillation: A Mathematical Framework for Probability-Domain Temperature Scaling and Multi-Stage Compression
por: Flouro, Aaron R., et al.
Publicado: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)

Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
por: Sølvsten, Steffan Christ, et al.
Publicado: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
por: Buchbinder, Niv, et al.
Publicado: (2024)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
por: Feldman, Moran, et al.
Publicado: (2026)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
por: Borodin, Allan, et al.
Publicado: (2025)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
por: Shlyk, Vasiliy S.
Publicado: (2026)

Tree Containment Parameterized by Scanwidth
por: van Iersel, Leo, et al.
Publicado: (2026)

APTAS for bin packing with general cost structures
por: Jaykrishnan, G., et al.
Publicado: (2024)

The Distributional Tail of Worst-Case Quickselect
por: Płecha, Witold
Publicado: (2026)

The Bottom-Left Algorithm for the Strip Packing Problem
por: Hougardy, Stefan, et al.
Publicado: (2024)

Strongly Sublinear Algorithms for Testing Pattern Freeness
por: Newman, Ilan, et al.
Publicado: (2021)