Skip to content

Commit

Permalink
Docs: typo fixes
Browse files Browse the repository at this point in the history
  • Loading branch information
PoslavskySV committed Oct 19, 2017
1 parent f70e19f commit aae6963
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 2 deletions.
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@
Rings: efficient Java/Scala library for polynomial rings
========================================================

Rings is an efficient implementation of univariate and multivariate polynomial algebra over arbitrary coefficient rings. It make use of asymptotically fast algorithms for basic algebraic operations as well as for advanced methods like GCDs and polynomial factorization. Performance achieved in Rings is comparable to well known solutions like Singular/NTL/FLINT/Maple/Mathematica.
Rings is an efficient implementation of univariate and multivariate polynomial algebra over arbitrary coefficient rings. It makes use of asymptotically fast algorithms for basic algebraic operations as well as for advanced methods like GCDs and polynomial factorization. Performance achieved in Rings is comparable to well known solutions like Singular/NTL/FLINT/Maple/Mathematica.

The key features of Rings include:

Expand Down
2 changes: 1 addition & 1 deletion doc/index.rst
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
Rings: efficient Java/Scala library for polynomial rings
########################################################

|Rings| is an efficient implementation of univariate and multivariate polynomial algebra over arbitrary coefficient rings. It make use of asymptotically fast algorithms for basic algebraic operations as well as for advanced methods like GCDs and polynomial factorization. Performance achieved in |Rings| is comparable to well known solutions like Singular/NTL/FLINT/Maple/Mathematica.
|Rings| is an efficient implementation of univariate and multivariate polynomial algebra over arbitrary coefficient rings. It makes use of asymptotically fast algorithms for basic algebraic operations as well as for advanced methods like GCDs and polynomial factorization. Performance achieved in |Rings| is comparable to well known solutions like Singular/NTL/FLINT/Maple/Mathematica.

The key features of |Rings| include:

Expand Down

0 comments on commit aae6963

Please sign in to comment.