Functional decomposition-whether a function f (x) can be written as a composition of functions g(h(x)) in a non-trivial way-is an important primitive in symbolic computation systems. The problem of univariate polynomial decomposition was shown to have an efficient solution by Kozen and Landau (1989)
โฆ LIBER โฆ
Algebraic functions
โ Scribed by H. Hornich
- Publisher
- Springer Vienna
- Year
- 1935
- Tongue
- English
- Weight
- 93 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0026-9255
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Decomposition of Algebraic Functions
โ
Dexter Kozen; Susan Landau; Richard Zippel
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 554 KB
Superpositions of algebraic functions
โ
V. Ya. Lin
๐
Article
๐
1976
๐
Springer US
๐
English
โ 643 KB
Computational Complexity of Algebraic Fu
โ
Nicholas Pippenger
๐
Article
๐
1981
๐
Elsevier Science
๐
English
โ 919 KB
Algebraic values of meromorphic function
โ
Serge Lang
๐
Article
๐
1965
๐
Elsevier Science
๐
English
โ 538 KB
Zero testing of algebraic functions
โ
Richard Zippel
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 427 KB
It is well known that we can efficiently test whether a polynomial is identically zero or not by examining the values of the polynomial at well-chosen points. Both deterministic and efficient probabilistic algorithms have been devised for this purpose. It is not so well recognized that algebraic fun
On superpositions of algebraic functions
โ
V. Ya. Lin
๐
Article
๐
1973
๐
Springer US
๐
English
โ 171 KB