Almost polynomial Complexity for Zero-dimensional Grbner Bases - Archive ouverte HAL
Communication Dans Un Congrès Année : 2005

Almost polynomial Complexity for Zero-dimensional Grbner Bases

Fichier non déposé

Dates et versions

hal-01416432 , version 1 (14-12-2016)

Identifiants

  • HAL Id : hal-01416432 , version 1

Citer

Amir Hashemi, Daniel Lazard. Almost polynomial Complexity for Zero-dimensional Grbner Bases. ASCM 2005 - 7th Asian Symposium on Computer Mathematics, Dec 2005, Seoul, South Korea. pp.16-21. ⟨hal-01416432⟩
91 Consultations
0 Téléchargements

Partager

More