Functional Decomposition

As the name implies, functional decomposition is the processing of breaking functional requirements into smaller parts that can be implemented in software. One of the most important concepts in functional decomposition is it must be possible to reconstruct the original functionality from the parts created in the decomposition process. This rule assures that the decomposition was done correctly and that the desired functionality will be in place in the implemented software.

[1]  Tomás Recio,et al.  A Rational Function Decomposition Algorithm by Near-Separated Polynomials , 1995, J. Symb. Comput..

[2]  Joachim von zur Gathen,et al.  Functional Decomposition of Polynomials: The Tame Case , 1990, J. Symb. Comput..

[3]  Richard Zippel,et al.  Rational function decomposition , 1991, ISSAC '91.

[4]  Joachim von zur Gathen,et al.  On Multivariate Polynomial Decomposition , 1999, CASC.

[5]  Jörn Müller-Quade,et al.  Basic Algorithms for Rational Function Fields , 1999, J. Symb. Comput..

[6]  Joachim von zur Gathen,et al.  Multivariate Polynomial Decomposition , 2003, Applicable Algebra in Engineering, Communication and Computing.