Analyzing Runtime Complexity via Innermost Runtime Complexity

Florian Frohn, Jürgen Giesl. Analyzing Runtime Complexity via Innermost Runtime Complexity. In Thomas Eiter, David Sands, editors, LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, 7-12th May 2017. Volume 46 of EPiC Series, pages 249-268, EasyChair, 2017. [doi]

@inproceedings{FrohnG17,
  title = {Analyzing Runtime Complexity via Innermost Runtime Complexity},
  author = {Florian Frohn and Jürgen Giesl},
  year = {2017},
  url = {http://www.easychair.org/publications/paper/340352},
  researchr = {https://researchr.org/publication/FrohnG17},
  cites = {0},
  citedby = {0},
  pages = {249-268},
  booktitle = {LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, 7-12th May 2017},
  editor = {Thomas Eiter and David Sands},
  volume = {46},
  series = {EPiC Series},
  publisher = {EasyChair},
}