Zobrazeno 1 - 10
of 18
pro vyhledávání: '"ensembles triangulaires"'
Autor:
Fabrice Rouillier, Solen Corvez
Publikováno v:
Fourth International Workshop on Automated Deduction in Geometry-ADG 2002
Fourth International Workshop on Automated Deduction in Geometry-ADG 2002, Sep 2002, Hagenberg, Austria. pp.31-43, ⟨10.1007/978-3-540-24616-9_3⟩
Automated Deduction in Geometry ISBN: 9783540209270
Automated Deduction in Geometry
Fourth International Workshop on Automated Deduction in Geometry-ADG 2002, Sep 2002, Hagenberg, Austria. pp.31-43, ⟨10.1007/978-3-540-24616-9_3⟩
Automated Deduction in Geometry ISBN: 9783540209270
Automated Deduction in Geometry
Colloque avec actes et comité de lecture. internationale.; International audience; In this paper we present a classification of 3-revolute-jointed manipulators based on the cuspidal behaviour. It was shown in a previous work [16] that this ability t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f4efacffb8bf68b89b1c8831d8915cb
https://hal.inria.fr/inria-00100987
https://hal.inria.fr/inria-00100987
Publikováno v:
Mathematics of Computation; Jul2020, Vol. 89 Issue 324, p1993-2015, 23p
Autor:
Mou, Chenqi
Publikováno v:
Symbolic Computation [cs.SC]. Université Pierre et Marie Curie, 2013. English
Polynomial system solving over finite fields is of particular interest because of its applications in Cryptography, Coding Theory, and other areas of information science and technologies. In this thesis we study several important theoretical and comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::7aa9123c1d7a3c8667b70db3b8f87e73
https://tel.archives-ouvertes.fr/tel-01110887/file/ThesisChenqiMOU_final.pdf
https://tel.archives-ouvertes.fr/tel-01110887/file/ThesisChenqiMOU_final.pdf
Autor:
Mou, Chenqi
Publikováno v:
Symbolic Computation [cs.SC]. Université Pierre et Marie Curie, 2013. English. ⟨NNT : ⟩
Symbolic Computation [cs.SC]. Université Pierre et Marie Curie, 2013. English
Symbolic Computation [cs.SC]. Université Pierre et Marie Curie, 2013. English
Polynomial system solving over finite fields is of particular interest because of its applications in Cryptography, Coding Theory, and other areas of information science and technologies. In this thesis we study several important theoretical and comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7aa9123c1d7a3c8667b70db3b8f87e73
https://theses.hal.science/tel-01110887
https://theses.hal.science/tel-01110887
Autor:
Dahan, Xavier
Les systèmes polynomiaux sous forme triangulaire, notamment les chaînes régulières et en particulier les ensembles triangulaires (de Lazard), sont des structures de données simples, permettant d'envisager des calculs modulaires (par spécialisat
Externí odkaz:
http://pastel.archives-ouvertes.fr/pastel-00003835
http://pastel.archives-ouvertes.fr/docs/00/50/37/11/PDF/Dahan.pdf
http://pastel.archives-ouvertes.fr/docs/00/50/37/11/PDF/Dahan.pdf
Complexity of polynomial systems representations: triangulation, modular methods, dynamic evaluation
Autor:
Dahan, Xavier
The polynomial systems in their triangular shape, notably the regular chains and especially the Lazard triangular sets, are simple data structures, permitting to consider modular computations (by specialization of the coefficients, then lifting throu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::cd1026534eb151b423d463ce5f01f114
https://pastel.archives-ouvertes.fr/pastel-00003835
https://pastel.archives-ouvertes.fr/pastel-00003835
Autor:
Zhang, Gui-Lin, Gao, Xiao-Shan
Publikováno v:
Computer Mathematics; 2008, p307-321, 15p
Autor:
LAZARD, D.
Publikováno v:
Computer Mathematics - Proceedings of the Fourth Asian Symposium (Ascm 2000); 2000, p1-8, 8p
Publikováno v:
RAIRO - Theoretical Informatics & Applications; Oct2005, Vol. 39 Issue 4, p651-659, 9p
Autor:
Mohab Safey El Din, Èric Schost
Publikováno v:
Discrete & Computational Geometry; Sep2004, Vol. 32 Issue 3, p417-430, 14p