Filtrer vos résultats
- 98
- 29
- 57
- 45
- 17
- 3
- 3
- 1
- 1
- 2
- 1
- 118
- 39
- 1
- 21
- 3
- 10
- 10
- 7
- 16
- 9
- 14
- 8
- 9
- 7
- 8
- 9
- 7
- 3
- 4
- 1
- 1
- 1
- 124
- 2
- 1
- 125
- 7
- 6
- 5
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 127
- 49
- 10
- 10
- 9
- 6
- 6
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
127 résultats
|
|
Faster FFTs in Medium Precision2015 IEEE 22nd Symposium on Computer Arithmetic (ARITH), Jun 2015, Lyon, France. pp.75-82, ⟨10.1109/arith.2015.10⟩
Communication dans un congrès
hal-02350505v1
|
||
|
|
From implicit to recursive equationsApplicable Algebra in Engineering, Communication and Computing, 2019, 30 (3), pp.243-262. ⟨10.1007/s00200-018-0370-2⟩
Article dans une revue
hal-00583125v2
|
||
|
|
Deterministic root finding over finite fields using Graeffe transforms2015
Pré-publication, Document de travail
hal-01104251v1
|
||
|
|
Multiple precision floating point arithmetic on SIMD processors2017
Pré-publication, Document de travail
hal-01429594v2
|
||
|
|
Fast Polynomial Multiplication over F_(2^60)2016
Pré-publication, Document de travail
hal-01265278v1
|
||
|
|
Efficient Certification of Numeric Solutions to EigenproblemsMathematical Aspects of Computer and Information Sciences, pp.81-94, 2017, ⟨10.1007/978-3-319-72453-9_6⟩
Chapitre d'ouvrage
hal-02350517v1
|
||
|
|
LU factorization with errorsInternational Symposium on Symbolic and Algebraic Computation - ISSAC'19, Jul 2019, Beijing, China. pp.131-138, ⟨10.1145/3326229.3326244⟩
Communication dans un congrès
hal-01997592v1
|
||
|
|
Newton's method and FFT trading2009
Pré-publication, Document de travail
hal-00434307v1
|
||
|
|
A zero test for σ-algebraic power seriesInternational Symposium on Symbolic and Algebraic Computation 2021, Jul 2021, Saint Petersbourg, Russia. ⟨10.1145/3452143.3465549⟩
Communication dans un congrès
hal-03132700v1
|
||
|
|
Accelerated tower arithmeticJournal of Complexity, 2019, 55, pp.101402. ⟨10.1016/j.jco.2019.03.002⟩
Article dans une revue
hal-01788403v2
|
||
|
|
GNU TEXmacsACM Communications in Computer Algebra, 2013, 47 (1/2), pp.59. ⟨10.1145/2503697.2503708⟩
Article dans une revue
hal-02350495v1
|
||
|
|
Fast evaluation of holonomic functionsTheoretical Computer Science, 1999, 210 (1), pp.199-215. ⟨10.1016/s0304-3975(98)00102-9⟩
Article dans une revue
hal-02350531v1
|
||
|
|
Maximal immediate extensions of valued differential fieldsProceedings of the London Mathematical Society, 2018, 117 (2), pp.376-406. ⟨10.1112/plms.12128⟩
Article dans une revue
hal-02350543v1
|
||
The Frobenius FFTThe International Symposium on Symbolic and Algebraic Computation 2017, Jul 2017, Kaiserslautern, France. pp.437-444, ⟨10.1145/3087604.3087633⟩
Communication dans un congrès
hal-02350408v1
|
|||
|
|
Certified Singular Value Decomposition2018
Pré-publication, Document de travail
hal-01941987v1
|
||
|
|
Surreal substructures2022
Pré-publication, Document de travail
hal-02151377v3
|
||
Multiplication rapideÉcole thématique. Journées nationales de calcul formel, Luminy, France. 2022
Cours
hal-04117383v1
|
|||
|
|
Fast computation of generic bivariate resultantsJournal of Complexity, 2021, ⟨10.1016/j.jco.2020.101499⟩
Article dans une revue
hal-02080426v1
|
||
|
|
Getallen vermenigvuldigen in O(n log n) stappen.Nieuw Archief voor Wiskunde, 2020
Article dans une revue
hal-03013445v1
|
||
|
|
Sparse polynomial interpolation. Exploring fast heuristic algorithms over finite fields2019
Pré-publication, Document de travail
hal-02382117v1
|
||
|
|
Implementing the Tangent Graeffe Root Finding MethodInternational Congress on Mathematical Software 2020, Jul 2020, Braunschweig, Germany. pp.482-492, ⟨10.1007/978-3-030-52200-1_48⟩
Communication dans un congrès
hal-03013390v1
|
||
|
|
Fuchsian holonomic sequences2022
Pré-publication, Document de travail
hal-03291372v2
|
||
|
|
On the complexity of polynomial reduction2012
Rapport
hal-00658704v1
|
||
|
|
Modular composition via complex roots2017
Pré-publication, Document de travail
hal-01455731v2
|
||
|
|
On the complexity of skew arithmetic2011
Pré-publication, Document de travail
hal-00557750v4
|
||
|
|
Conservative conversion between LaTeX and TeXmacs2014
Pré-publication, Document de travail
hal-00952926v1
|
||
|
|
On the complexity of multivariate blockwise polynomial multiplication2012
Pré-publication, Document de travail
hal-00660454v1
|
||
|
|
On the bit-complexity of sparse polynomial and series multiplication2010
Pré-publication, Document de travail
hal-00476223v1
|
||
|
|
Interfacing Mathemagix with C++2013
Pré-publication, Document de travail
hal-00771214v1
|
||
|
|
Logarithmic hyperseriesTransactions of the American Mathematical Society, 2019, 372 (7), pp.5199-5241. ⟨10.1090/tran/7876⟩
Article dans une revue
hal-02350409v1
|