On the data structure straight-line program and its implementation in symbolic computation

Mathematics and Computers in Simulation

Volumn 51, Issue 5, 2000, Pages 497-528

  Castaño, Bonifacio ^a   Heintz, Joos ^b,c   Llovet, Juan ^a   Martínez, Raquel ^d  

^a UNIVERSITY OF ALCALÁ   (Spain)

^b UNIVERSITY OF CANTABRIA   (Spain)

^c UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^d UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Arithmetic boolean circuit; Directed acyclic graph; Evaluation; Greatest common divisor of multivariate polynomials; Linear recurring sequence; Mixed representation; Multivariate polynomial; Straight line program

Indexed keywords

EID: 0010634078     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0378-4754(99)00140-8     Document Type: Article

References (44)

1. B. Bank, M. Giusti, J. Heintz, G. Mbakop, Polar varieties and efficient real equation solving: the hypersurface case, J. Complexity 13(1) (1997) 5-27.
2. S.J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Information Processing Letters 18 (1984) 147-150.
3. A. Borodin, Time space tradeoffs (getting closer to the barrier?), Algorithms and Computation, Proceedings 4, ISSAC, LNCS, vol. 762, Springer, Berlin, 1993, pp. 209-220.
4. N. Bruno, Esquemas de compilación de circuitos aritméticos uniformes descritos por medio de funciones generatrices, Masters Thesis, FaMAF, Universidad de Córdoba, Argentina, 1998.
5. P. Bürgisser, M. Clausen, M. Amin Shokrollahi, Algebraic Complexity Theory, Grundlehren der mathematischen Wissenschaften, vol. 315, Springer, Berlin, 1997.
6. G.E. Collins, Subresultants and related polynomial sequences, J. Assoc. Comput. Mach. 14 (1967) 128-142.
7. A.L. Díaz, Foxbox: a system for manipulating symbolic objects in black box representation, Ph.D. Thesis, Rensselaer Polytechnic Institute, Troy, USA, 1997.
8. N. Fitchas, M. Giusti, F. Smietanski, Sur la complexitédu théorème des zéros, in: M. Florenzano, J. Guddat, M. Jimenez, H. Th. Jongen, G. Lopez Lagomasino, F. Marcellan (Eds.), Approximation and Optimization in the Caribbean II, Proceedings 2nd Int. Conf. on Non-Linear Optimization and Approximation, Approximation and Optimization, vol. 8, Peter Lange Verlag, Frankfurt am Main, 1995, pp. 247-329.
9. T.S. Freeman, G.M. Imirzian, E. Kaltofen, L. Yagati, DAGWOOD - a system for manipulating polynomials given by straight-line programs, ACM Transactions on Mathematical Software 14(3) (1988) 218-240.
10. F.R. Gantmacher, The Theory of Matrices, vol. 1/2, Chelsea, New York, 1959.
11. M. Giusti, K. Hägele, J. Heintz, I.E. Morais, J.L. Montaña, L.M. Pardo, Lower bounds for diophantine approximation, Proceedings of MEGA'96, J. Pure and Appl. Algebra 117/118 (1997) 277-317.
12. M. Giusti, K. Hägele, G. Lecerf, J. Marchand, B. Salvy, Computing the dimension of a projective variety, Research Report 3224 INRIA, France, 1997.
13. M. Giusti, J. Heintz, La détermination des points isolés et de la dimension d'une variétéalgébrique peut se faire en temps polynomial, in: D. Eisenbud, L. Robbiano (Eds.), Computational Algebraic Geometry and Commutative Algebra, Symposia Matematica, vol. 34, Cambridge University Press, Cambridge, 1993, pp. 216-256.
14. M. Giusti, J. Heintz, J.E. Morais, J. Morgenstern, L.M. Pardo, Straight-line programs in geometric elimination theory, J. Pure Appl. Algebra 124 (1997) 1-46.
15. M. Giusti, J. Heintz, J.E. Morais, L.M. Pardo, Le rôle des structures de données dans les problèmes d'élimination, C.R. Acad. Sci. Paris Série I 325 (1997) 1223-1228.
16. M. Giusti, J. Heintz, J. Sabia, On the efficiency of effective Nullstellensätze, Computational Complexity 3 (1993) 56-95.
17. M. Giusti, G. Lecerf, B. Salvy, A Gröbner free alternative for polynomial systems solving, Foundations of Computational Mathematics (FoCM'99), 1999, submitted for publication.
18. D. Grigoriev, M. Karpinski, A zero-test and an interpolation algorithm for the shifted sparse polynomials, in: G. Cohen, T. Mora, O. Moreno (Eds.), Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-10, San Juan de Puerto Puerto Rico May 1993, LNCS, vol. 673, Springer, Berlin, 1993, pp. 162-169.
19. K. Hägele, J.L. Montaña, Polynomial random test for the equivalence problem of integers given by arithmetic circuits, Preprint 4/97 Depto. Matemáticas, Universidad de Cantabria, Santander, Spain, 1997.
20. J. Heintz, T. Krick, S. Puddu, J. Sabia, A. Waissbein, Deformation techniques for efficient polynomial equation solving to appear in Journal of Complexity, 1988.
21. J. Heintz, G. Matera, A. Waissbein, On the time-space complexity of geometric elimination procedures, Applicable Algebra in Engineering, Communications and Complexity, AAECC Journal, 1999, Submitted for publication .
22. J. Heintz, C.P. Schnorr, Testing polynomials which are easy to compute, Logic and Algorithmic, Monographie del'Enseignement Mathématique, vol. 30, 1982, pp. 237-254.
23. J. Heintz, M. Sieveking, Absolute primality of polynomials is decidable in random polynomial-time in the number of variables, Proceedings ICALP 81, LNCS, vol. 115, Springer, Berlin, 1981, pp. 16-28.
24. O.H. Ibarra, S. Moran, Probabilistic algorithms for deciding equivalence of straight-line programs, J. ACM 30 (1983) 217-228.
25. O.H. Ibarra, S. Moran, L.E. Rosier, Probabilistic algorithms and straight-line programs for some rank decision problems, Information Processing Letters 12(5) (1981) 227-232.
26. E. Kaltofen, Computing with polynomials given by straight-line programs I: greatest common divisors, Proceedings of the 17th Ann. ACM Symposium on Theory of Computing, ACM, New York, 1985, pp. 131-142.
27. E. Kaltofen, Greatest common divisors of polynomials given by straight-line programs, J. ACM 35(1) (1988) 231-264.
28. E. Kaltofen, Factorization of polynomials given by straight-line programs, in: S. Micali (Ed.), Randomness in Computation, Advances in Computing Research, vol. 5, JAI Press Inc., 1989, pp. 375-412
29. T. Krick, L.M. Pardo, Une approche informatique pour l' approximation diophantienne, C.R. Acad. Sci. Paris Série I 318 (1994) 407-412.
30. T. Krick, L.M. Pardo, A computational method for diophantine approximation, in: L. González-Vega, T. Recio (Eds.), Algorithms in Algebraic Geometry and Applications, Proceedings of MEGA'94, Progress in Mathematics, vol. 143, Birkhauser, Basel, 1996, pp. 193-254.
31. J. Llovet, R. Martínez, J.A. Jaén, Linear recurring sequences for computing the resultant of multivariate polynomials, Journal of Computational and Applied Mathematics 49 (1993) 145-152.
32. J. Llovet, R. Sendra, J.A. Jaén, R. Martínez, An algorithm for computing multivariate polynomial resultants, Computer Science, 1992, pp. 159-165.
33. R. Martínez, Procedimientos de Recurrencia Lineal en Algebra Computacional, PhD Thesis, Depto. de Matemáticas, Universidad de Alcalá de Henares, España, 1992.
34. G. Matera, J.M. Turull Torres, The space complexity of elimination: upper bounds, in: F. Cucker, M. Shub (Eds.), Proceedings Foundations of Computational Mathematics (FOCM'97), Springer, Berlin, 1997, pp. 267-276
35. R.A. De Millo, R.J. Lipton, A probabilistic remark on algebraic program testing, Inf. Proc. Letters 7(4) (1978) 193-195.
36. S. Puddu, J. Sabia, An effective algorithm for quantifier elimination over algebraically closed fields using straight-line programs, J. Pure Appl. Algebra 129 (1998) 173-200.
37. A. Rege, J. Canny, A toolkit for algebra and geometry, Preprint, 1995.
38. A. Schönhage, On the power of random access machines, in: H.A. Maurer (Ed.), Proceedings of the 6th Colloquium on Automata, Languages and Programming, LNCS, vol. 71, Springer, Berlin, 1979, pp. 520-529.
39. J.T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980) 701-717.
40. R. Sendra, J. Llovet, An extended polynomial gcd algorithm using Hankel matrices, Journal of Symbolic Computation 13 (1992) 25-39.
41. J. von zur Gathen, Parallel arithmetic computations: a survey, in: B. Rovan (Ed.), Proceedings of the 12th Symposium on Mathematical Foundations of Computer Science, LNCS, vol. 233, Bratislava, Czechoslovakia, Springer, 1986, pp. 93-112.
42. J. von zur Gathen, Parallel linear algebra, in: J.H. Reif (Ed.), Synthesis of Parallel Algorithms, Morgan Kaufmann, Los Altos, CA, 1993, pp. 573-617.
43. R. Zippel, Probabilistic algorithms for sparse polynomials, Proceedings EUROSAM' 79, LNCS, vol. 72, 1979, pp. 216-226.
44. R. Zippel, Effective Polynomial Computation, ECS 241, Kluwer Academic Publishers, Dordrecht, 1993.