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 489 articles , 5 standard articles )

Showing results 401 to 420 of 489.
Sorted by year (citations)

previous 1 2 3 ... 19 20 21 22 23 24 25 next

  1. Kemper, Gregor: The calculation of radical ideals in positive characteristic (2002)
  2. Lechuga, Luis: Computing the Sullivan Milnor-Moore S. S. and the rational LS category of certain spaces (2002)
  3. Pérez-Carretero, Cristina; Laita, Luis M.; Roanes-Lozano, Eugenio; Lázaro, Luis; González-Cajal, Jesús; Laita, Laura: A logic and computer algebra-based expert system for diagnosis of anorexia (2002)
  4. Sabadini, Irene; Sommen, Frank: Hermitian Clifford analysis and resolutions (2002)
  5. Sabadini, Irene; Struppa, Daniele C.; Sommen, Frank; Van Lancker, Peter: Complexes of Dirac operators in Clifford algebras (2002)
  6. Sabadini, I.; Sommen, F.: Special first order systems in Clifford analysis and resolutions. (2002)
  7. Sturmfels, Bernd: Solving systems of polynomial equations (2002)
  8. Uriel, Ana González; Lozano, Eugenio Roanes: Expert system for managing urban planning parameters (2002) MathEduc
  9. Van Tuyl, Adam: The border of the Hilbert function of a set of points in $\Bbb P^n_1\times \cdots \times \Bbb P^n_k$ (2002)
  10. Wang, Mingsheng; Kwong, C.P.: Computing GCLF using syzygy algorithm (2002)
  11. Zhang, Shenggui; Jiang, Zhaolin; Liu, Sanyang: An application of the Gröbner basis in computation for the minimal polynomials and inverses of block circulant matrices (2002)
  12. Armando, Alessandro; Zini, Daniele: Interfacing computer algebra and deduction systems via the logic broker architecture (2001)
  13. Bazzotti, Laura; Dalzotto, Giorgio; Robbiano, Lorenzo: Remarks on geometric theorem proving (2001)
  14. Carlini, Enrico; Huy Tài Hà; Van Tuyl, Adam: Computing the spreading and covering numbers (2001)
  15. Colley, Susan Jane; Kennedy, Gary: Detecting flat normal cones using Segre classes. (2001)
  16. Conca, Aldo; Rossi, Maria Evelina; Valla, Giuseppe: Gröbner flags and Gorenstein algebras (2001)
  17. Cortadellas, Teresa; Zarzuela, Santiago: Burch’s inequality and the depth of the blow up rings of an ideal. (2001)
  18. Fatabbi, G.: On the resolution of ideals of fat points (2001)
  19. Fatabbi, Giuliana; Lorenzini, Anna: On a sharp bound for the regularity index of any set of fat points (2001)
  20. Laita, L.M.; González-Páez, G.; Roanes-Lozano, E.; Maojo, V.; de Ledesma, L.; Laita, L.: A methodology for constructing expert systems for medical diagnosis (2001)

previous 1 2 3 ... 19 20 21 22 23 24 25 next

Further publications can be found at: