%0 Conference Paper %1 conf/cie/Ben-AmramJK08 %A Ben-Amram, Amir M. %A Jones, Neil D. %A Kristiansen, Lars %B CiE %D 2008 %E Beckmann, Arnold %E Dimitracopoulos, Costas %E Löwe, Benedikt %I Springer %K dblp %P 67-76 %T Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. %U http://dblp.uni-trier.de/db/conf/cie/cie2008.html#Ben-AmramJK08 %V 5028 %@ 978-3-540-69405-2

@inproceedings{conf/cie/Ben-AmramJK08, added-at = {2017-05-19T00:00:00.000+0200}, author = {Ben-Amram, Amir M. and Jones, Neil D. and Kristiansen, Lars}, biburl = {https://www.bibsonomy.org/bibtex/283ca7f45f2a13cb5118fb3e5f821225f/dblp}, booktitle = {CiE}, crossref = {conf/cie/2008}, editor = {Beckmann, Arnold and Dimitracopoulos, Costas and Löwe, Benedikt}, ee = {https://doi.org/10.1007/978-3-540-69407-6_7}, interhash = {39b9f8d57294433a8f482a9fb7ee120c}, intrahash = {83ca7f45f2a13cb5118fb3e5f821225f}, isbn = {978-3-540-69405-2}, keywords = {dblp}, pages = {67-76}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T17:08:22.000+0200}, title = {Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.}, url = {http://dblp.uni-trier.de/db/conf/cie/cie2008.html#Ben-AmramJK08}, volume = 5028, year = 2008 }