Imagen de Portada

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Alpay, Faruk, Sarioglu, Levent
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Computational Complexity 68Q25, 68Q27, 05C85
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Algorithms for Minimum Membership Dominating Set Problem
por: Reddy, Sangam Balchandar, et al.
Publicado: (2024)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
por: Alpay, Faruk, et al.
Publicado: (2026)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

On weighted graph separation problems and flow-augmentation
por: Kim, Eun Jung, et al.
Publicado: (2022)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
por: Alpay, Faruk, et al.
Publicado: (2026)

Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
por: Alpay, Faruk, et al.
Publicado: (2026)

Steiner Tree Parameterized by Multiway Cut and Even Less
por: Jansen, Bart M. P., et al.
Publicado: (2024)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
por: Jansen, Klaus, et al.
Publicado: (2024)

Parameterized Complexity of Directed Traveling Salesman Problem
por: Blažej, Václav, et al.
Publicado: (2025)

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
por: Alpay, Faruk, et al.
Publicado: (2026)

On Binary Networked Public Goods Game with Altruism
por: Maiti, Arnab, et al.
Publicado: (2022)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
por: Abdullah, Duaa, et al.
Publicado: (2025)

Polynomial-Time Solutions for Longest Common Subsequence Related Problems Between a Sequence and a Pangenome Graph
por: Li, Xingfu, et al.
Publicado: (2026)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
por: Agrawal, Akanksha, et al.
Publicado: (2024)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
por: Bojikian, Narek, et al.
Publicado: (2025)

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Ineffectiveness for Search and Undecidability of PCSP Meta-Problems
por: Larrauri, Alberto
Publicado: (2025)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
por: Alpay, Faruk, et al.
Publicado: (2026)

Mim-Width is paraNP-complete
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
por: Philip, Geevarghese, et al.
Publicado: (2026)

Optimal Hardness of Online Algorithms for Large Independent Sets
por: Gamarnik, David, et al.
Publicado: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
por: Bubeck, Sébastien, et al.
Publicado: (2022)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
por: Chen, Yijia, et al.
Publicado: (2023)

Parallel Algorithms for Group Isomorphism via Code Equivalence
por: Levet, Michael
Publicado: (2026)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
por: Lin, Tianrong
Publicado: (2023)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
por: Golovach, Petr A., et al.
Publicado: (2022)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
por: Liu, Bowen
Publicado: (2025)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
por: Cui, Jinchuan, et al.
Publicado: (2022)

Binary Tree Block Encoding of Classical Matrix
por: Li, Zexian, et al.
Publicado: (2025)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
por: Göbel, Andreas, et al.
Publicado: (2025)

Parameterized Algorithms for Kidney Exchange
por: Maiti, Arnab, et al.
Publicado: (2021)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
por: Böhnlein, Toni, et al.
Publicado: (2024)

On Solving Reachability in Grid Digraphs using a Psuedoseparator
por: Jain, Rahul, et al.
Publicado: (2019)

Efficient Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Nonlinear Cellular Automata
por: Wang, Chen, et al.
Publicado: (2023)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
por: Li, Zhangsong
Publicado: (2026)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
por: Meusel, Julia, et al.
Publicado: (2025)

Complexity of Sequence-to-Graph Alignment with Co-Linear Chaining
por: Li, Xingfu
Publicado: (2026)

Polynomial Identity Testing via Evaluation of Rational Functions
por: Hu, Ivan, et al.
Publicado: (2022)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
por: Li, Zhangsong
Publicado: (2025)

DAG Scheduling in the BSP Model
por: Papp, Pál András, et al.
Publicado: (2023)