Imagen de Portada

Exact (n + 2) Comparison Complexity for the N-Repeated Element Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Au, Andrew
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Tight Lower Bound for Cycle Detection in Grid Graphs
por: Au, Andrew
Publicado: (2026)

Two Linear Passes Are Necessary for Sum-Exclude-Self Under Sublinear Space
por: Au, Andrew
Publicado: (2026)

Submodular Maximization in Exactly $n$ Queries
por: Balkanski, Eric, et al.
Publicado: (2024)

An Exact Algorithm for the Unanimous Vote Problem
por: Keles, Feyza Duman, et al.
Publicado: (2025)

Maximizing the Margin between Desirable and Undesirable Elements in a Covering Problem
por: Boileau, Sophie, et al.
Publicado: (2025)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
por: Eisenbrand, Friedrich, et al.
Publicado: (2024)

On Beating $2^n$ for the Closest Vector Problem
por: Abboud, Amir, et al.
Publicado: (2025)

Closed Repeats
por: Kosolobov, Dmitry
Publicado: (2024)

Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
por: Bodwin, Greg, et al.
Publicado: (2023)

On the Complexity of Secluded Path Problems
por: Hanaka, Tesshu, et al.
Publicado: (2026)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
por: Murakami, Hitoshi, et al.
Publicado: (2024)

The Complexity of Dynamic LZ77 is $\tildeΘ(n^{2/3})$
por: Boneh, Itai, et al.
Publicado: (2025)

Towards Settling the Complexity of the Lettericity Problem
por: Grobler, Mario, et al.
Publicado: (2026)

Computational Complexity of the Interval Ordering Problem
por: Pawlowski, Simeon, et al.
Publicado: (2026)

PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team
por: Jünger, Michael, et al.
Publicado: (2024)

On the Hardness Hierarchy for the $O(n \sqrt{\log n})$ Complexity in the Word RAM
por: Kempa, Dominik, et al.
Publicado: (2025)

Query Complexity of the Metric Steiner Tree Problem
por: Chen, Yu, et al.
Publicado: (2022)

Complexity Classes for Online Problems with and without Predictions
por: Berg, Magnus, et al.
Publicado: (2024)

On the Complexity of Distributed Edge Coloring and Orientation Problems
por: Brandt, Sebastian, et al.
Publicado: (2025)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
por: Ganian, Robert, et al.
Publicado: (2024)

Algorithms and Complexity of Hedge Cluster Deletion Problems
por: Konstantinidis, Athanasios L., et al.
Publicado: (2025)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
por: Dhar, Saurav, et al.
Publicado: (2024)

Two Complexity Results on Spanning-Tree Congestion Problems
por: Atalig, Sunny, et al.
Publicado: (2026)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
por: Chen, Yong, et al.
Publicado: (2025)

Relating Left and Right Extensions of Maximal Repeats
por: Inenaga, Shunsuke, et al.
Publicado: (2024)

An Exact Solver for Submodular Knapsack Problems
por: Münch, Sabine, et al.
Publicado: (2025)

Space Complexity of Minimum Cut Problems in Single-Pass Streams
por: Ding, Matthew, et al.
Publicado: (2024)

A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
por: Komusiewicz, Christian, et al.
Publicado: (2023)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
por: Jin, Mingming, et al.
Publicado: (2023)

Solving Random Planted CSPs below the $n^{k/2}$ Threshold
por: Basu, Arpon, et al.
Publicado: (2025)

Exactly Hittable Interval Graphs
por: Dhannya, S. M., et al.
Publicado: (2023)

Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees
por: Hu, Ivan, et al.
Publicado: (2022)

Exact Optimization for Minimum Dominating Sets
por: Zhu, Enqiang, et al.
Publicado: (2025)

R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies
por: Kimura, Kotaro, et al.
Publicado: (2025)

An $\mathcal{O}(\log N)$ Time Algorithm for the Generalized Egg Dropping Problem
por: Papadopoulos, Kleitos
Publicado: (2026)

Complexity and Algorithm for the Matching vertex-cutset Problem
por: Li, Hengzhe, et al.
Publicado: (2025)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
por: Tayal, Mumuksh
Publicado: (2025)

Exact Short Products From Truncated Multipliers
por: Lemire, Daniel
Publicado: (2023)

Advances in Exact and Approximate Group Closeness Centrality Maximization
por: Schulz, Christian, et al.
Publicado: (2026)

Linear Kernels for $l$-Exact Component Order Connectivity
por: Liu, Yuxi, et al.
Publicado: (2026)