On the Bit Complexity of Solving Bilinear Polynomial Systems

Ioannis Emiris 1 Angelos Mantzaflaris 2 Elias Tsigaridas 3
1 AROMATH - AlgebRe, geOmetrie, Modelisation et AlgoriTHmes
CRISAM - Inria Sophia Antipolis - Méditerranée , UoA - University of Athens
2 RICAM - Johann Radon Institute for Computational and Applied Mathematics
3 PolSys - Polynomial Systems
Inria de Paris, LIP6 - Laboratoire d'Informatique de Paris 6
Type de document :
Communication dans un congrès
ISSAC '16 - 41st International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. ACM, pp.215-222, 〈10.1145/2930889.2930919〉
Liste complète des métadonnées
https://hal.inria.fr/hal-01401134
Contributeur : Ioannis Emiris <>
Soumis le : mardi 22 novembre 2016 - 23:19:24
Dernière modification le : lundi 29 mai 2017 - 14:23:33

Identifiants

Collections

INSMI | UPMC | LIP6 | INRIA

Citation

Ioannis Emiris, Angelos Mantzaflaris, Elias Tsigaridas. On the Bit Complexity of Solving Bilinear Polynomial Systems. ISSAC '16 - 41st International Symposium on Symbolic and Algebraic Computation, Jul 2016, Waterloo, Canada. ACM, pp.215-222, 〈10.1145/2930889.2930919〉. 〈hal-01401134〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

161

Contact


archive-ouverte@inria.fr