CoCoA is a system for Computations in Commutative Algebra. It is able to perform simple and sophisticated operations on multivaraiate polynomials and on various data related to them (ideals, modules, matrices, rational functions). For example, it can readily compute Grobner bases, syzygies and minimal free resolution, intersection, division, the radical of an ideal, the ideal of zero-dimensional schemes, Poincare’ series and Hilbert functions, factorization of polynomials, toric ideals. The capabilities of CoCoA and the flexibility of its use are further enhanced by the dedicated high-level programming language. For convenience, the system offers a textual interface, an Emacs mode, and a graphical user interface common to most platforms. Computer algebra system (CAS).

This software is also referenced in ORMS.

References in zbMATH (referenced in 542 articles , 5 standard articles )

Showing results 481 to 500 of 542.
Sorted by year (citations)

previous 1 2 3 ... 23 24 25 26 27 28 next

  1. Fontana, Roberto; Pistone, Giovanni; Rogantin, Maria Piera: Classification of two-level factorial fractions (2000)
  2. Gatermann, Karin: Computer algebra methods for equivariant dynamical systems (2000)
  3. Greuel, Gert-Martin: Computer algebra and algebraic geometry -- achievements and perspectives (2000)
  4. Kreuzer, Martin; Robbiano, Lorenzo: Computational commutative algebra. I (2000)
  5. Marcelo, Agustín; Rodríguez, César: Radical of submodules and symmetric algebra (2000)
  6. Migliore, Juan; Nagel, Uwe; Peterson, Chris: Constructing schemes with prescribed cohomology in arbitrary codimension (2000)
  7. Migliorini, Massimiliano; Tomassini, Adriano: Local calibrations of almost complex structures (2000)
  8. Miller, Ezra: The Alexander duality functors and local duality with monomial support (2000)
  9. Thiéry, Nicolas M.: Algebraic invariants of graphs; a study based on computer exploration (2000)
  10. Assan, Jean; Perdon, Anna M.: An efficient computation of the solution of the block decoupling problem with coefficient assignment over a ring. (1999)
  11. Assan, J.; Lafay, J. F.; Perdon, A. M.: Computation of maximal pre-controllability submodules over a Noetherian ring (1999)
  12. Bigatti, Anna Maria; La Scala, Roberto; Robbiano, Lorenzo: Computing toric ideals (1999)
  13. Holliday, Tim; Pistone, Giovanni; Ricomagno, Eva; Wynn, Henry P.: The applications of computational algebraic geometry to the analysis of designed experiments: a case study (1999)
  14. Pistone, Giovanni; Wynn, Henry P.: Finitely generated cumulants (1999)
  15. Brundu, M.; Logar, A.: Parametrization of the orbits of cubic surfaces (1998)
  16. Buchberger, Bruno (ed.); Winkler, Franz (ed.): Gröbner bases and applications. Based on a course for young researchers, January 1998, and the conference “33 years of Gröbner bases”, Linz, Austria, February 2--4, 1998 (1998)
  17. Capani, Antonio; Niesi, Gianfranco: The CoCoA 3 framework for a family of Buchberger-like algorithms (1998)
  18. Conca, Aldo: Straightening law and powers of determinantal ideals of Hankel matrices (1998)
  19. Greuel, Gert-Martin; Pfister, Gerhard: Gröbner bases and algebraic geometry (1998)
  20. Greuel, G. M.: Standard bases and applications (1998)

previous 1 2 3 ... 23 24 25 26 27 28 next

Further publications can be found at: