Polynomial-Time Algorithm for Hilbert Series of Borel Type Ideals - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Polynomial-Time Algorithm for Hilbert Series of Borel Type Ideals

Résumé

In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D is the highest degree of a minimal generator of input (monomial) ideal.
Fichier non déposé

Dates et versions

hal-01308229 , version 1 (27-04-2016)

Identifiants

Citer

Amir Hashemi. Polynomial-Time Algorithm for Hilbert Series of Borel Type Ideals. SNC'07: Symbolic-Numeric Computation'07, Jul 2007, London, Ontario, Canada. pp.97-102, ⟨10.1145/1277500.1277516⟩. ⟨hal-01308229⟩
21 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More