Files:

[HTML]  

Abstract:

(unavailable)

BibTeX:
@article{burr:hal-01953446,
  TITLE =        {{The Complexity of Subdivision for Diameter-Distance
                  Tests}},
  AUTHOR =       {Burr, Michael and Gao, Shuhong and Tsigaridas,
                  Elias},
  URL =          {https://hal.inria.fr/hal-01953446},
  JOURNAL =      {{Journal of Symbolic Computation}},
  PUBLISHER =    {{Elsevier}},
  YEAR =         2018,
  KEYWORDS =     {Worst case bit-complexity ; Adaptive complexity ;
                  Separation bounds ; Subdivision algorithms ;
                  Continuous amortization ; Algorithmic complexity},
  PDF =
                  {https://hal.inria.fr/hal-01953446/file/PV%20Paper.pdf},
  HAL_ID =       {hal-01953446},
  HAL_VERSION =  {v1},
}

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