Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen. Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. In Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe, editors, Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings. Volume 5028 of Lecture Notes in Computer Science, pages 67-76, Springer, 2008. [doi]
@inproceedings{Ben-AmramJK08,
title = {Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time},
author = {Amir M. Ben-Amram and Neil D. Jones and Lars Kristiansen},
year = {2008},
doi = {10.1007/978-3-540-69407-6_7},
url = {http://dx.doi.org/10.1007/978-3-540-69407-6_7},
researchr = {https://researchr.org/publication/Ben-AmramJK08},
cites = {0},
citedby = {0},
pages = {67-76},
booktitle = {Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings},
editor = {Arnold Beckmann and Costas Dimitracopoulos and Benedikt Löwe},
volume = {5028},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-69405-2},
}