The decidability of functional decomposition problem

MaRDI QIDQ2858322zbMATH OpenFDO

Authors Chaoxu Tong, Shangwei Zhao, Xiao-Shan Gao

Publication date 19 November 2013

Published in Journal of Systems Science and Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

functional decomposition problemHilbert 10th problemundecidability

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Decidability and field theory (12L05) Cryptography (94A60)

Recommendations

• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• Decomposition of algebraic functions
• scientific article; zbMATH DE number 1273634
• General polynomial decomposition and the s-1-decomposition are NP-Hard
• scientific article; zbMATH DE number 2125607

Cited in

(2)

• scientific article; zbMATH DE number 1143806 (Why is no real title available?)
• The decidable properties of subrecursive functions

This page was built for publication: The decidability of functional decomposition problem

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