Complexity issues in bivariate polynomial factorization

Alin Bostan 1 Grégoire Lecerf 2 Bruno Salvy 1 Éric Schost Bernd Wiebelt
1 ALGO - Algorithms
Inria Paris-Rocquencourt
2 LMV - Laboratoire de Mathématiques de Versailles
Document type :
Conference papers
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-00186759
Contributor : Grégoire Lecerf <>
Submitted on : Monday, November 12, 2007 - 11:20:58 AM
Last modification on : Wednesday, January 23, 2019 - 2:39:26 PM

Identifiers

  • HAL Id : hal-00186759, version 1

Collections

INRIA | LM-VERSAILLES | UVSQ | INRIA-ROCQ

Citation

Alin Bostan, Grégoire Lecerf, Bruno Salvy, Éric Schost, Bernd Wiebelt. Complexity issues in bivariate polynomial factorization. Complexity issues in bivariate polynomial factorization, 2004, Spain. pp.42-49. ⟨hal-00186759⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

139

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD