On the solvability of a class of diophantine equations and applications

8Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For 1≤i≤k, let Ri denote pi(y)Fi+Gi, where pi(y) is a polynomial in y with integer coefficients, and Fi,Gi are linear polynomials in x1,...,xn with integer coefficients. Let P(z1,...,zk) be a Presburger relation over the nonnegative integers. We show that the following problem is decidable:Given: R1,...,Rk and a Presburger relation P.Question: Are there nonnegative integer values for y,x1,...,xn such that for these values, (R1,...,Rk) satisfies P?We also give some applications to decision problems concerning counter machines. © 2006 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Ibarra, O. H., & Dang, Z. (2006). On the solvability of a class of diophantine equations and applications. Theoretical Computer Science, 352(1–3), 342–346. https://doi.org/10.1016/j.tcs.2005.12.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free