Elias' Article

A Superfast Randomized Algorithm to Decompose Binary Forms.
Mat\'ias R Bender, Jean-Charles Faugère, Ludovic Perret, and Elias Tsigaridas.
In Proc. 41st Int'l Symposium on Symbolic and Algebraic Computation, pp. 79–86, ACM, Waterloo, Canada, July 2016.

HAL version available here.

• Home
• Research
• Teaching
• Contact

Files:

[HTML]  

Abstract:

(unavailable)

@inproceedings{bfpt-ninform-16,
  TITLE =        {{A Superfast Randomized Algorithm to Decompose
                  Binary Forms}},
  AUTHOR =       {Bender, Mat{\'i}as R and Faug{\`e}re, Jean-Charles
                  and Perret, Ludovic and Tsigaridas, Elias},
  URL =          {https://hal.inria.fr/hal-01363545},
  BOOKTITLE =    {{Proc.  41st Int'l Symposium on Symbolic and
                  Algebraic Computation}},
  ADDRESS =      {Waterloo, Canada},
  PUBLISHER =    {{ACM}},
  PAGES =        {79-86},
  YEAR =         2016,
  MONTH =        Jul,
  KEYWORDS =     {Binary Form Decomposition ; Superfast Algorithm ;
                  Hankel Matrix ; Complexity ; Algebraic Degree ;
                  Canonical Form ; Waring's problem},
  HAL_ID =       {hal-01363545},
  HAL_VERSION =  {v1},
}

Generated by bib2html.pl (written by Patrick Riley , modified by Elias ) on Wed Oct 23, 2019 21:41:02