Rings : An efficient Java/Scala library for polynomial rings

Published: 11 Oct 2018 | Version 1 | DOI: 10.17632/2k79hftjy9.1
Contributor(s):

Description of this data

In this paper we briefly discuss Rings — an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gröbner bases are implemented with the use of modern asymptotically fast algorithms. Rings can be easily interacted or embedded in applications in high-energy physics and other research areas via a simple API with fully typed hierarchy of algebraic structures and algorithms for commutative algebra. The use of the Scala language brings a quite novel powerful, strongly typed functional programming model allowing to write short, expressive, and fast code for applications. At the same time Rings shows one of the best performances among existing software for algebraic calculations.

Experiment data files

This data is associated with the following publication:

Rings : An efficient Java/Scala library for polynomial rings

Published in: Computer Physics Communications

Latest version

  • Version 1

    2018-10-11

    Published: 2018-10-11

    DOI: 10.17632/2k79hftjy9.1

    Cite this dataset

    Poslavsky, Stanislav (2018), “Rings : An efficient Java/Scala library for polynomial rings”, Mendeley Data, v1 http://dx.doi.org/10.17632/2k79hftjy9.1

Categories

Computational Physics

Mendeley Library

Organise your research assets using Mendeley Library. Add to Mendeley Library

Licence

Apache-2.0 Learn more

The files associated with this dataset are licensed under a Apache License 2.0 licence.

What does this mean?

Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.

Report