General polynomial decomposition and the s-1-decomposition are NP-Hard

DOI10.1142/S0129054193000109zbMath0802.68062OpenAlexW2113186437MaRDI QIDQ4286117

Matthew T. Dickerson

Publication date: 11 December 1994

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054193000109

zbMATH Keywords

NP-hardpolynomial decompositionfunctional decomposition of polynomialsmultivariate decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (1)

An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography

This page was built for publication: General polynomial decomposition and the s-1-decomposition are NP-Hard