Aliev, Iskander  ORCID: https://orcid.org/0000-0002-2206-9207
2019.
On polynomial-time solvable linear Diophantine problems.
Moscow Journal of Combinatorics and Number Theory
8
(4)
, pp. 357-365.
|
Preview |
PDF
- Accepted Post-Print Version
Download (346kB) | Preview |
Official URL: http://doi.org/10.2140/moscow.2019.8.357
Abstract
We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m
| Item Type: | Article |
|---|---|
| Date Type: | Publication |
| Status: | Published |
| Schools: | Schools > Mathematics |
| Subjects: | Q Science > QA Mathematics |
| ISSN: | 2220-5438 |
| Date of First Compliant Deposit: | 1 August 2019 |
| Date of Acceptance: | 16 July 2019 |
| Last Modified: | 18 Nov 2024 04:00 |
| URI: | https://orca.cardiff.ac.uk/id/eprint/124630 |
Actions (repository staff only)
 |
Edit Item |
Download Statistics
Download Statistics