On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | ISSAC '13 : Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation |
| Author | Faugère, Jean-Charles, Safey El Din, Mohab, Verron, Thibaut |
| Maintainer | CCSD |
| Last Updated | May 11, 2026, 05:42 (UTC) |
| Created | May 11, 2026, 05:42 (UTC) |
| Identifier | hal-00780388 |
| Language | en |
| Rights | https://about.hal.science/hal-authorisation-v1/ |
| contributor | Polynomial Systems (PolSys) ; Laboratoire d'Informatique de Paris 6 (LIP6) ; Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria) |
| coverage | Boston, Maine, United States |
| creator | Faugère, Jean-Charles |
| date | 2013-06-26T00:00:00 |
| harvest_object_id | 36082bb1-9a53-446b-9424-11fca7697340 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-02-26T00:00:00 |
| relation | info:eu-repo/semantics/altIdentifier/arxiv/1301.5612 |
| set_spec | type:COMM |