Elias' Article

On the Bit Complexity of Solving Bilinear Polynomial Systems.
Ioannis Z. Emiris, Angelos Mantzaflaris, and Elias Tsigaridas.
In Proc. 41st Int'l Symposium on Symbolic and Algebraic Computation, pp. 215–222, ACM, Waterloo, Canada, July 2016.

HAL version available here.

• Home
• Research
• Teaching
• Contact

Files:

[HTML]  

Abstract:

(unavailable)

@inproceedings{EmiManTsi-bilinear-16,
  TITLE =        {{On the Bit Complexity of Solving Bilinear
                  Polynomial Systems}},
  AUTHOR =       {Emiris, Ioannis Z. and Mantzaflaris, Angelos and
                  Tsigaridas, Elias},
  URL =          {https://hal.inria.fr/hal-01401134},
  BOOKTITLE =    {{Proc. 41st Int'l Symposium on Symbolic and
                  Algebraic Computation}},
  ADDRESS =      {Waterloo, Canada},
  PUBLISHER =    {{ACM}},
  PAGES =        {215-222},
  YEAR =         2016,
  MONTH =        Jul,
  HAL_ID =       {hal-01401134},
  HAL_VERSION =  {v1},
}

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