Efficiently Certifying Non-Integer Powers

Erich Kaltofen, Mark Lavin. Efficiently Certifying Non-Integer Powers. Computational Complexity, 19(3):355-366, 2010. [doi]

@article{KaltofenL10,
  title = {Efficiently Certifying Non-Integer Powers},
  author = {Erich Kaltofen and Mark Lavin},
  year = {2010},
  doi = {10.1007/s00037-010-0297-x},
  url = {http://dx.doi.org/10.1007/s00037-010-0297-x},
  researchr = {https://researchr.org/publication/KaltofenL10},
  cites = {0},
  citedby = {0},
  journal = {Computational Complexity},
  volume = {19},
  number = {3},
  pages = {355-366},
}