Cover Image

Solving Modular Linear Systems with a Constraint by parallel decomposition of the Smith form and extended Euclidean division modulo powers of primes divisors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Sule, Virendra
Format:	Preprint
Published:	2025
Subjects:	Number Theory Discrete Mathematics Data Structures and Algorithms G.0; G.2.0; I.1.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
by: Chen, Yongyu
Published: (2023)

Efficient Approximation of Fractional Hypertree Width
by: Korchemna, Viktoriia, et al.
Published: (2024)

Polynomial Complexity of Inversion of sequences and Local Inversion of Maps
by: Sule, Virendra
Published: (2024)

Skolem Meets Bateman-Horn
by: Luca, Florian, et al.
Published: (2023)

Deciding One to One property of Boolean maps: Condition and algorithm in terms of implicants
by: Sule, Virendra
Published: (2023)

Faster Mixing for Triangulations via Transport Flows
by: Alev, Vedat Levi, et al.
Published: (2026)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2026)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
by: Kavi, Nithin
Published: (2024)

Reducing Matroid Optimization to Basis Search
by: Streit, Robert, et al.
Published: (2024)

Finding the Center and Centroid of a Graph with Multiple Sources
by: Chou, Matthew
Published: (2024)

On the Orthogonality of Generalized Pattern Sequences
by: Li, Shuo
Published: (2024)

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands
by: Shalaby, Ahmed, et al.
Published: (2024)

Polymer Dynamics via Cliques: New Conditions for Approximations
by: Friedrich, Tobias, et al.
Published: (2020)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
by: Nishimura, Yuki, et al.
Published: (2025)

Searching in trees with $k$-up-modular cost functions
by: Szyfelbein, Michał
Published: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
by: Jacob, Ashwin, et al.
Published: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
by: Adamson, Duncan, et al.
Published: (2023)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
by: Shota, Kan, et al.
Published: (2024)

Local generation of languages
by: Hoyrup, Mathieu
Published: (2025)

Local generation of languages: the monotonic binary sequences
by: Hoyrup, Mathieu
Published: (2026)

Lower Bounds for Leaf Rank of Leaf Powers
by: Høgemo, Svein
Published: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
by: Bourneuf, Romain, et al.
Published: (2025)

Optimal distance query reconstruction for graphs without long induced cycles
by: Bastide, Paul, et al.
Published: (2023)

Pop Stacks with a Bypass
by: Cioni, Lapo, et al.
Published: (2024)

Rotation distance using flows
by: Mathieu, Claire, et al.
Published: (2024)

Random Schreier graphs as expanders
by: Caillat-Grenier, Geoffroy
Published: (2023)

Online Paging with Heterogeneous Cache Slots
by: Chrobak, Marek, et al.
Published: (2022)

Approximation Algorithms for Correlated Knapsack Orienteering
by: Espinosa, David Aleman, et al.
Published: (2024)

Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
by: Chauhan, Archit, et al.
Published: (2026)

Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)

Deterministic Minimum Steiner Cut in Maximum Flow Time
by: Ding, Matthew, et al.
Published: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
by: Eiben, Eduard, et al.
Published: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
by: Ma, Will, et al.
Published: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
by: Varona, Luis M. B.
Published: (2026)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
by: Ibrahimpur, Sharat, et al.
Published: (2025)

Arborescences and Shortest Path Trees when Colors Matter
by: Ardra, P. S., et al.
Published: (2024)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
by: Könen, David, et al.
Published: (2023)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
by: Streit, Robert P., et al.
Published: (2024)

Online Bipartite Matching in the Probe-Commit Model
by: Borodin, Allan, et al.
Published: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
by: Ma, Will, et al.
Published: (2024)