多项式时间可解线性丢番图问题

Q4 Mathematics

Moscow Journal of Combinatorics and Number Theory Pub Date : 2019-03-14 DOI:10.2140/moscow.2019.8.357

I. Aliev

{"title":"多项式时间可解线性丢番图问题","authors":"I. Aliev","doi":"10.2140/moscow.2019.8.357","DOIUrl":null,"url":null,"abstract":"We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m<n, with nonsingular mxm submatrix B and b is an m-dimensional integer vector, finds a nonnegative integer solution to the system Ax=b or determines that no such solution exists, provided that b is located sufficiently \"deep\" in the cone generated by the columns of B. This result improves on some of the previously known conditions that guarantee polynomial-time solvability of linear Diophantine problems.","PeriodicalId":36590,"journal":{"name":"Moscow Journal of Combinatorics and Number Theory","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2140/moscow.2019.8.357","citationCount":"0","resultStr":"{\"title\":\"On polynomial-time solvable linear Diophantine problems\",\"authors\":\"I. Aliev\",\"doi\":\"10.2140/moscow.2019.8.357\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m<n, with nonsingular mxm submatrix B and b is an m-dimensional integer vector, finds a nonnegative integer solution to the system Ax=b or determines that no such solution exists, provided that b is located sufficiently \\\"deep\\\" in the cone generated by the columns of B. This result improves on some of the previously known conditions that guarantee polynomial-time solvability of linear Diophantine problems.\",\"PeriodicalId\":36590,\"journal\":{\"name\":\"Moscow Journal of Combinatorics and Number Theory\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.2140/moscow.2019.8.357\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Moscow Journal of Combinatorics and Number Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2140/moscow.2019.8.357\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow Journal of Combinatorics and Number Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2140/moscow.2019.8.357","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

我们得到了一个多项式时间算法，给定输入(a, b)，其中a =(b |N)是一个整数mxn矩阵，m< N，具有非奇异的mxm子矩阵b, b是一个m维整数向量，求出系统Ax=b的一个非负整数解或确定不存在这样的解。假设b位于由b列生成的锥的足够“深”处，该结果改进了先前已知的保证线性丢梵图问题多项式时间可解的一些条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On polynomial-time solvable linear Diophantine problems

We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊