Some complexity results for polynomial ideals

Journal of Complexity

Volumn 13, Issue 3, 1997, Pages 303-325

  Mayr, Ernst W ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031232452     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1997.0447     Document Type: Article

References (56)

1. 1. Aiba, A., Sakai, K., Sato, Y., Hawley, D. J., and Hasegawa, R. (1988). Constrained logic programming language CAL, in "Proceedings of the International Conference on Fifth Generation Computer Systems 1988, Tokyo, Nov./Dec. 1988," Vol. 1, pp. 263-276. Institute for New Generation Computer Technology, ICOT.
2. 2. Balcázar, J. L., Díaz, J., and Gabarró, J. (1988), "Structural Complexity I," EATCS Monographs on Theoretical Computer Science, Vol. 11, Springer-Verlag, Berlin/Heidelberg/ New York/London/Paris,
3. 3. Bayer, D. A. (1982), "The Division Algorithm and the Hilbert Scheme," Ph.D. thesis. Department of Mathematics, Harvard University.
4. 4. Berenstein, C., and Yger, A. (1990), Bounds for the degrees in the division problem, Michigan Math. J. 37(1), 25-43.
5. 5. Berkowitz, S. J. (1984), On computing the determinant in small parallel time using a small number of processors, Inform. Process. Lett. 18(3), 147-150.
6. 6. Borodin, A. (1977), On relating time and space to size and depth, SIAM J. Comput. 6(4), 733-744.
7. 7. Borodin, A., von zur Gathen, J., and Hoperoft, J. (1982), Fast parallel matrix and GCD computations, Inform. and Control 52, 241-256.
8. 8. Brownawell, W. D. (1987), Bounds for the degrees in the Nullstellensatz, Ann. of Math. 126, 577-591.
9. 9. Buchberger, B. (1965), "Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal," Ph.D. thesis. Department of Mathematics, University of Innsbruck.
10. 10. Buchberger, B. (1985), Gröbner bases: An algorithmic method in polynomial ideal theory, in "Multidimensional Systems Theory" (N. K. Bose, Ed.), pp. 184-232, Reidel, Dordrecht/ Boston/London.
11. 11. Caniglia, L., Galligo, A., and Heintz, J. (1988), Some new effectivity bounds in computational geometry, in "Proceedings of AAECC-6, Rome, 1988," Lecture Notes in Computer Science, Vol. 357, pp. 131-152, Springer-Verlag, Berlin/Heidelberg/New York.
12. 12. Cardoza, E., Lipton, R., and Meyer, A. R. (1976), Exponential space complete problems for Petri nets and commutative semigroups, in "Proceedings of the 8th Annual ACM Symposium on Theory of Computing, Hershey, PA, 1976," pp. 50-54, ACM Press, New York.
13. 13. Cardoza, E. W. (1975), "Computational Complexity of the Word Problem for Commutative Semigroups," Tech. Memo. 67, Project MAC, M.I.T.
14. 14. Cox, D., Little, J., and O'Shea, D. (1992), "Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra," Springer-Verlag, Berlin/ Heidelberg/New York.
15. 15. Csanky, L. (1976), Fast parallel matrix inversion algorithms, SIAM J. Comput. 5(4), 618-623.
16. 16. Dubé, T. W. (1990), The structure of polynomial ideals and Gröbner bases, SIAM J. Comput. 19, 750-773.
17. 17. Dubé, T. W., Mishra, B., and Yap, C. K. (1986), "Admissible Orderings and Bounds for Gröbner Bases Normal Form Algorithms," Tech. Rep. 258. Department of Computer Science, Courant Institute of Mathematical Sciences, New York University.
18. 18. Eilenberg, S., and Schützenberger, M. P. (1969), Rational sets in commutative monoids, J. Algebra 13, 173-191.
19. 19. Eisenbud, D., and Robbiano, L. (Eds.) (1993), "Computational Algebraic Geometry and Commutative Algebra, Symposia Mathematica," Vol. 34, Cambridge Univ. Press, Cambridge.
20. 20. Eisenbud, D., and Sturmfels, B. (1994), "Binomial ideals."
21. 21. Fitchas, N., Galligo, A., and Morgenstern, J. (1990), Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, J. Pure Appl. Algebra 67, 1-14.
22. 22. Fortune, S., and Wyllie, J. (1978), Parallelism in random access machines, in "Proceedings of the 10th Annual ACM Symposium on Theory of Computing, San Diego, CA," pp. 114-118. ACM Press, New York.
23. 23. Franck-Le Plateau, D. Y., Giusti, M., Hägele, K., Morais, J. E., Montaña, J. L., and Pardo, L. M. (1996), Lower bounds for diophantine approximation, in "MEGA'96," to appear.
24. 24. Galil, Z., and Pan, V. (1989), Parallel evaluation of the determinant and of the inverse of a matrix, Inform. Process. Lett. 30, 41-45.
25. 25. Giusti, M. (1984), Some effectivity problems in polynomial ideal theory, in "Proceedings of the 3rd International Symposium on Symbolic and Algebraic Computation EUROSAM 84, Cambridge, July 9-11, 1984," Lecture Notes in Computer Science, Vol. 174 (J. Fitch, Ed.), pp. 159-171, ACM SIGSAM, SAME/Springer-Verlag, Berlin/Heidelberg/New York.
26. 26. Giusti, M., Heintz, J., and Sabia, J. (1993), On the efficiency of effective Nullstellensätze. Comput. Complexity 3, 56-95.
27. 27. Hermann, G. (1926), Die Frage der endlich vielen Schritte in der Theorie der Polynomideale, Math. Ann. 95, 736-788.
28. 28. Huynh, D. T. (1985), The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems, in "Proceedings of the 17th Ann. ACM Symposium on Theory of Computing, Providence, RI," pp. 405-412, ACM Press, New York.
29. 29. Huynh, D. T. (1986), A superexponential lower bound for Gröbner bases and Church-Rosser commutative Thue systems, Inform. and Control 68(1-3), 196-206.
30. 30. Ibarra, O. H., Moran, S., and Rosier, L. E. (1980), A note on the parallel complexity of computing the rank of order n matrices, Inform. Process. Lett. 11, 162.
31. 31. Kollár, J. (1988), Sharp effective Nullstellensatz, J. Amer. Math. Soc. 1, 963-975.
32. 32. Koppenhagen, U., and Mayr, E. W. (1995), "The Complexity of the Boundedness, Coverability, and Selfcoverability Problems for Commutative Semigroups," Tech. Rep. TUM-19518. Institut für Informatik, Technische Universität München.
33. 33. Koppenhagen, U., and Mayr, E. W. (1996), "An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals," Tech. Rep. TUM-I9605. Institut für Informatik, Technische Universität München.
34. 34. Koppenhagen, U., and Mayr, E. W. (1996), An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, in "Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISAAC'96, Zürich, July 24-26, 1996," pp. 55-62, ACM Press, New York.
35. 35. Koppenhagen, U., and Mayr, E. W. (1996), "Optimal Gröbner Base Algorithms for Binomial Ideals," Tech. Rep. TUM-I9604. Institut für Informatik, Technische Universität München.
36. 36. Koppenhagen, U., and Mayr, E. W. (1996), "The Complexity of the Equivalence Problem for Commutative Semigroups," Tech. Rep. TUM-I9603. Institut für Informatik, Technische Universität München.
37. 37. Krick, T., and Logar, A. (1991), Membership problem, representation problem and the computation of the radical for one-dimensional ideals, in "Proceedings of Effective Methods in Algebraic Geometry, MEGA'90," Progress in Mathematics, Vol. 94, pp. 203-216, Birkhäuser, Boston/Basel/Berlin/Stuttgart.
38. 38. Kühnle, K., and Mayr, E. W. (1996), "Exponential space computation of Gröbner bases," Tech. Rep. TUM-I9606. Institut für Informatik, Technische Universität München.
39. 39. Kühnle, K., and Mayr, E. W. (1996), Exponential space computation of Gröbner bases, in "Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, ISAAC'96, Zürich, July 24-26, 1996," pp. 63-71, ACM Press, New York.
40. 40. Lakshman, Y. N. (1990), On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal, in "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 14-16, 1990," pp. 555-563, ACM Press, New York.
41. n] et élimination, Bull. Soc. Math. France 105, 165-190.
42. 42. Lazard, D. (1983), Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, in J. A. van Hulzen, Ed., "Proceedings of the European Computer Algebra Conference, Eurocal '83, London, March 1983," Lecture Notes in Computer Science, Vol. 162, pp. 146-156, Springer-Verlag, New York/Berlin/Heidelberg.
43. 43. Mayr, E. W. (1989), Membership in polynomial ideals over ℚ is exponential space complete, in "Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, Feb. 1989," Lecture Notes in Computer Science, Vol. 349 (B. Monien and R. Cori, Eds.), pp. 400-406, Springer-Verlag, Berlin/Heidelberg/New York.
44. 44. Mayr, E. W. (1992), Polynomial ideals and applications, in "Festschrift zum 300jährigen Bestehen der Gesellschaft," Mitteilungen der Mathematischen Gesellschaft in Hamburg 12(4), 1207-1215.
45. 45. Mayr, E. W., and Meyer, A. (1982), The complexity of the word problems for commutative semigroups and polynomial ideals, Adv. in Math. 46(3), 305-329.
46. 46. Minsky, M. L. (1967), "Computation: Finite and Infinite Machines," Prentice-Hall, Englewood Cliffs, NJ.
47. 47. Möller, H. M., and Mora, F. (1984), Upper and lower bounds for the degree of Groebner bases, in "Proceedings of the 3rd International Symposium on Symbolic and Algebraic Computation EUROSAM 84, Cambridge, July 9-11, 1984," Lecture Notes in Computer Science, Vol. 174, (J. Fitch, Ed.), pp. 172-183, ACM SIGSAM, SAME/Springer-Verlag, Berlin/Heidelberg/ New York.
48. 48. Mulmuley, K. (1986), A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, in "Proceedings of the 18th Annual ACM Symposium on Theory of Computing," pp. 338-339, ACM Press, New York.
49. 49. Pan, V (1987), Complexity of parallel matrix computations. Theoret. Comput. Sci. 54(1), 65-85.
50. 50. Post, E. (1947), Recursive unsolvability of a problem of Thue, J. Symbolic Logic 12, 1-11.
51. 51. Preparata, F. P., and Sarwate, D. V. (1978), An improved parallel processor bound in fast matrix inversion. Inform. Process. Lett. 7(2), 148-150.
52. 52. Richman, F. (1974), Constructive aspects of Noetherian rings, Proc. Amer. Math. Soc. 44, 436-441.
53. 53. Robbiano, L. (1985), Term orderings on the polynomial ring, in "Proceedings of the 10th European Conference on Computer Algebra, EUROCAL'85, Vol. 2, Research Contributions," Lecture Notes in Computer Science, Vol. 204, pp. 513-517, Springer-Verlag, Berlin/ Heidelberg/New York.
54. 54. Seidenberg, A. (1974), Constructions in algebra, Trans. Amer. Math. Soc. 197, 273-313.
55. 55. Yap, K. (1991), A new lower bound construction for commutative Thue systems, with applications, J. Symbolic Comput. 12, 1-28.
56. 56. Zariski, O., and Samuel, P. (1958), "Commutative Algebra," Vol. I, University Series in Higher Mathematics, Van Nostrand-Reinhold, New York/Cincinnati/Toronto.