×

zbMATH — the first resource for mathematics

An NP-complete number-theoretic problem. (English) Zbl 1282.68138
Proceedings of the 10th annual ACM symposium on theory of computing, STOC’78, Dan Diego, CA, USA, May 1–3, 1978. New York, NY: Association for Computing Machinery (ACM). 205-215 (1978).

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