On the complexity of computing syzygies

Authors:
David Bayer;Michael Stillman
Affiliations:
Department of Mathematics, Columbia University, New York, NY 10027, U.S.A. and Department of Mathematics, Cornell University, Ithaca, NY 14853, U.S.A.;Department of Mathematics, Columbia University, New York, NY 10027, U.S.A. and Department of Mathematics, Cornell University, Ithaca, NY 14853, U.S.A.
Venue:
Journal of Symbolic Computation
Year:
1988

Citing 0
Cited 6

On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A new lower bound construction for commutative thue systems with applications

Journal of Symbolic Computation
A Gröbner basis technique for Padé approximation

Journal of Symbolic Computation
Gröbner Bases and Multidimensional FIR Multirate Systems

Multidimensional Systems and Signal Processing
Generalized Reduction to Compute Toric Ideals

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A zero-dimensional gröbner basis for AES-128

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a self-contained exposition of Mayr & Meyer's example of a polynomial ideal exhibiting double exponential degrees for the ideal membership problem, and generalise this example to exhibit minimal syzygies of double exponential degree. This demonstrates the existence of subschemes of projective space of double exponential regularity.