scientific article; zbMATH DE number 3592969

MaRDI QIDQ4162483zbMATH OpenFDO

Authors Kenneth L. Manders, Leonard M. Adleman

Publication date 1976

Mathematics Subject Classification ID

Elementary number theory (11A99) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited in

(8)

• New NP-hard and NP-complete polynomial and integer divisibility problems
• Data science applications to string theory
• The many aspects of counting lattice points in polytopes
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
• Minimizing cubic and homogeneous polynomials over integers in the plane
• Many bounded versions of undecidable problems are \textsf{NP}-hard
• The complexity of homomorphism reconstructibility
• The complexity of homomorphism reconstructibility

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162483)