On the Bit Complexity of Solving Bilinear Polynomial Systems

Ioannis Z. Emiris, Angelos Mantzaflaris, Elias P. Tsigaridas. On the Bit Complexity of Solving Bilinear Polynomial Systems. In Sergei A. Abramov, Eugene V. Zima, Xiao-Shan Gao, editors, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016. pages 215-222, ACM, 2016. [doi]

@inproceedings{EmirisMT16,
  title = {On the Bit Complexity of Solving Bilinear Polynomial Systems},
  author = {Ioannis Z. Emiris and Angelos Mantzaflaris and Elias P. Tsigaridas},
  year = {2016},
  doi = {10.1145/2930889.2930919},
  url = {http://doi.acm.org/10.1145/2930889.2930919},
  researchr = {https://researchr.org/publication/EmirisMT16},
  cites = {0},
  citedby = {0},
  pages = {215-222},
  booktitle = {Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016},
  editor = {Sergei A. Abramov and Eugene V. Zima and Xiao-Shan Gao},
  publisher = {ACM},
  isbn = {978-1-4503-4380-0},
}