Image de couverture de livre

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Tate, Elise, Grochow, Joshua A.
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Constant-Depth Circuit Complexity of Generating Quasigroups
par: Collins, Nathaniel A., et autres
Publié: (2024)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
par: Austrin, Per, et autres
Publié: (2024)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
par: Lee, Euiwoong, et autres
Publié: (2024)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
par: Buhrman, Harry, et autres
Publié: (2025)

Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic
par: Mao, Songtao
Publié: (2026)

String Consensus Problems with Swaps and Substitutions
par: Gabory, Estéban, et autres
Publié: (2025)

Hardness Results on Characteristics for Elastic-Degenerated Strings
par: Köppl, Dominik, et autres
Publié: (2024)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

Quantum Algorithm for Lexicographically Minimal String Rotation
par: Wang, Qisheng, et autres
Publié: (2020)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
par: Fujie, Yuto, et autres
Publié: (2025)

End Cover for Initial Value Problem: Complete Validated Algorithms with Complexity Analysis
par: Zhang, Bingwei, et autres
Publié: (2026)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
par: S., Karthik C., et autres
Publié: (2024)

Dominating Set Knapsack: Profit Optimization on Dominating Sets
par: Singh, Sipra
Publié: (2025)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
par: Dey, Palash, et autres
Publié: (2024)

Fine-Grained Complexity of Continuous Euclidean k-Center
par: Blank, Lotte, et autres
Publié: (2026)

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
par: Tale, Prafullkumar
Publié: (2025)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
par: Sato, Atsuki, et autres
Publié: (2024)

k-SUM Hardness Implies Treewidth-SETH
par: Lampis, Michael
Publié: (2025)

Analyzing and Leveraging the $k$-Sensitivity of LZ77
par: Bathie, Gabriel, et autres
Publié: (2026)

A Note on Approximability of Densest At-Least-k-Subgraph
par: Laekhanukit, Bundit, et autres
Publié: (2026)

FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
par: Chu, Huairui, et autres
Publié: (2023)

Rounding Large Independent Sets on Expanders
par: Bafna, Mitali, et autres
Publié: (2024)

Algorithms and Hardness for Estimating Statistical Similarity
par: Bhattacharyya, Arnab, et autres
Publié: (2025)

Deterministic Independent Sets in the Semi-Streaming Model
par: Ye, Daniel
Publié: (2025)

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
par: Bilò, Davide, et autres
Publié: (2025)

Parameterized Max Min Feedback Vertex Set
par: Lampis, Michael, et autres
Publié: (2023)

Lift-and-Project Integrality Gaps for Santa Claus
par: Bamas, Etienne
Publié: (2024)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
par: Maalouly, Nicolas El, et autres
Publié: (2025)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
par: Bilò, Davide, et autres
Publié: (2024)

Efficient Catalytic Graph Algorithms
par: Cook, James, et autres
Publié: (2025)

Improved Algorithm for Permutation Testing
par: Zhang, Xiaojin
Publié: (2020)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

The Complexity of Finding and Counting Subtournaments
par: Döring, Simon, et autres
Publié: (2025)

On the Parameterized Complexity of Odd Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2025)

On the Complexity of Signed Roman Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

On the Space Complexity of Online Convolution
par: Andersson, Joel Daniel, et autres
Publié: (2025)

Computational Complexity in Property Testing
par: Pinto Jr., Renato Ferreira, et autres
Publié: (2025)