Scholarlink

<p>Studying finite systems of Diophantine equations over finite configurations,we prove thatthe consistency problem for such systems is NP-complete.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations

  • 期刊论文

  • 发表日期：

    2025年5月1日

查看全文
  • N. T. Kogabaev

摘要

Studying finite systems of Diophantine equations over finite configurations,we prove thatthe consistency problem for such systems is NP-complete.