An NP-complete number-theoretic problem

DOI10.1145/800133.804349zbMath1282.68138OpenAlexW2068965032MaRDI QIDQ5402559

Eitan M. Gurari, Oscar H. Ibarra

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800133.804349

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Decidability (number-theoretic aspects) (11U05) Decidability of theories and sets of sentences (03B25) Higher degree equations; Fermat's equation (11D41) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (2)

On selective unboundedness of VASS ⋮ The complexity of the equivalence problem for two characterizations of Presburger sets

This page was built for publication: An NP-complete number-theoretic problem