Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 2007: STACS 2007 pp 308–319Cite as

An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4393))

Abstract

We show by an example that the number of reduction steps needed to compute a prefix Gröbner basis in a free monoid ring by interreduction can in fact be exponential in the size of the input. This answers an open question posed by Zeckzer in [Ze00].

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ackermann, P., Kreuzer, M.: Gröbner Basis Cryptosystems. In: AAECC 17, pp. 173–194 (2006)

    Google Scholar 

  2. Madlener, K., Reinert, B.: On Gröbner Bases in Monoid and Group Rings. In: Proc. ISSAC’93, pp. 54–263. ACM Press, New York (1993)

    Google Scholar 

  3. Mora, T.: Gröbner Bases for Non-Commutative Polynomial Rings. In: Calmet, J. (ed.) AAECC 1985. LNCS, vol. 229, pp. 353–362. Springer, Heidelberg (1986)

    Google Scholar 

  4. Mora, T.: An Introduction to Commutative and Noncommutative Gröbner Bases. Theoretical Computer Science 134, 131–173 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Reinert, B.: On Gröbner Bases in Monoid and Group Rings. PhD thesis, Universität Kaiserslautern (1995)

    Google Scholar 

  6. Reinert, B., Zeckzer, D.: MRC - A System for Computing Gröbner Bases in Monoid and Group Rings. Presented at the 6th Rhine Workshop on Computer Algebra. Sankt Augustin (1998)

    Google Scholar 

  7. Reinert, B., Zeckzer, D.: MRC - Data Structures and Algorithms for Computing in Monoid and Group Rings. Applicable Algebra and Engineering, Communications and Computing 10(1), 41–78 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Sattler-Klein, A.: An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings. Internal Report, Universität Kaiserslautern, to appear in (2007)

    Google Scholar 

  9. Zeckzer, D.: Implementation, Applications, and Complexity of Prefix Gröbner Bases in Monoid and Group Rings. PhD thesis, Universität Kaiserslautern (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Kaiserslautern, Fachbereich Informatik, Postfach 3049, 67653 Kaiserslautern, Germany

    Andrea Sattler-Klein

Authors
  1. Andrea Sattler-Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Thomas Pascal Weil

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Sattler-Klein, A. (2007). An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings. In: Thomas, W., Weil, P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70918-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70918-3_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70917-6

  • Online ISBN: 978-3-540-70918-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation