References in zbMATH (referenced in 35 articles , 1 standard article )

Showing results 1 to 20 of 35.
Sorted by year (citations)

1 2 next

  1. Belkić, Dževad: All the trinomial roots, their powers and logarithms from the Lambert series, Bell polynomials and Fox-Wright function: illustration for genome multiplicity in survival of irradiated cells (2019)
  2. Brieulle, Ludovic; De Feo, Luca; Doliskani, Javad; Flori, Jean-Pierre; Schost, Éric: Computing isomorphisms and embeddings of finite fields (2019)
  3. Pribitkin, Wladimir de Azevedo; Williams, Brandon: Short proof of Rademacher’s formula for partitions (2019)
  4. von Manteuffel, Andreas; Schabinger, Robert M.: Planar master integrals for four-loop form factors (2019)
  5. Asadi, Mohammadali; Brandt, Alexander; Moir, Robert H. C.; Moreno Maza, Marc: Sparse polynomial arithmetic with the BPAS library (2018)
  6. Haque, S. Anisul; Li, X.; Mansouri, F.; Moreno Maza, M.; Mohajerani, D.; Pan, W.: CUMODP: a CUDA library for modular polynomial computation (2018)
  7. Heim, Bernhard; Neuhauser, Markus; Weisse, Alexander: Records on the vanishing of Fourier coefficients of powers of the Dedekind eta function (2018)
  8. Nogneng, Dorian; Schost, Éric: On the evaluation of some sparse polynomials (2018)
  9. Bourquin, Raoul: Algorithms for the construction of high-order Kronrod rule extensions with application to sparse-grid integration (2017)
  10. Claus Fieker, William Hart, Tommy Hofmann, Fredrik Johansson: Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language (2017) arXiv
  11. Dubickas, Artūras; Hare, Kevin G.; Jankauskas, Jonas: No two non-real conjugates of a Pisot number have the same imaginary part (2017)
  12. Foissy, Loïc; Fromentin, Jean: A divisibility result in combinatorics of generalized braids (2017)
  13. Janko Boehm, Wolfram Decker, Simon Keicher, Yue Ren: Current Challenges in Developing Open Source Computer Algebra Systems (2017) arXiv
  14. Stanislav Poslavsky: Rings: an efficient Java/Scala library for polynomial rings (2017) arXiv
  15. Aguilar-Melchor, Carlos; Barrier, Joris; Guelton, Serge; Guinet, Adrien; Killijian, Marc-Olivier; Lepoint, Tancrède: \textscNFLlib: NTT-based fast lattice library (2016)
  16. Bangay, Shaun; Beliakov, Gleb: On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics. (2016)
  17. Böhm, Janko; Decker, Wolfram; Keicher, Simon; Ren, Yue: Current challenges in developing open source computer algebra systems (2016)
  18. Chen, Changbo; Covanov, Svyatoslav; Mansouri, Farnam; Moir, Robert H. C.; Maza, Marc Moreno; Xie, Ning; Xie, Yuzhen: The basic polynomial algebra subprograms (2016)
  19. Groves, A. Whitman; Roche, Daniel S.: Sparse polynomials in FLINT (2016)
  20. Mosunov, A. S.; Jacobson, M. J. jun.: Unconditional class group tabulation of imaginary quadratic fields to (| \Delta| < 2^40) (2016)

1 2 next