A Bound for a Solution of a Linear Diophantine Problem
From MaRDI portal
Publication:5658128
DOI10.1112/jlms/s2-6.1.61zbMath0246.10009OpenAlexW2095095818MaRDI QIDQ5658128
Publication date: 1972
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-6.1.61
Related Items (11)
The complexity of finding common partitions of genomes with predefined block sizes ⋮ A diophantine problem of Frobenius in terms of the least common multiple ⋮ Bounds for exponents of doubly stochastic primitive matrices ⋮ Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius ⋮ Skolem's solution to a problem of Frobenius ⋮ \(\omega\)-regular languages are testable with a constant number of queries ⋮ On exponents of primitive matrices ⋮ On a linear diophantine problem for geometrical type sequences ⋮ A multiple set version of the \(3k-3\) theorem ⋮ A bound connected with primitive matrices ⋮ Some contributions to the Frobenius' Problem
This page was built for publication: A Bound for a Solution of a Linear Diophantine Problem
