On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection

Brand, Cornelius; Sagraloff, Michael

doi:10.1145/2930889.2930934

by Cornelius Brand, Michael Sagraloff

Reference:

On the Complexity of Solving Zero-Dimensional Polynomial Systems via ProjectionCornelius Brand, Michael SagraloffProceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016 (Sergei A. Abramov, Eugene V. Zima, Xiao-Shan Gao, eds.), pages 151–158, 2016, ACM.

Bibtex Entry:

@inproceedings{DBLP:conf/issac/BrandS16,
  author    = {Cornelius Brand and
               Michael Sagraloff},
  editor    = {Sergei A. Abramov and
               Eugene V. Zima and
               Xiao{-}Shan Gao},
  title     = {On the Complexity of Solving Zero-Dimensional Polynomial Systems via
               Projection},
  booktitle = {Proceedings of the {ACM} on International Symposium on Symbolic and
               Algebraic Computation, {ISSAC} 2016, Waterloo, ON, Canada, July 19-22,
               2016},
  pages     = {151--158},
  publisher = {{ACM}},
  year      = {2016},
  url       = {10.1145/2930889.2930934">https://doi.org/10.1145/2930889.2930934},
  doi       = {10.1145/2930889.2930934},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/issac/BrandS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}