%0 Conference Paper %1 conf/icalp/Mehlhorn74 %A Mehlhorn, Kurt %B ICALP %D 1974 %E Loeckx, Jacques %I Springer %K dblp %P 317-325 %T The Älmost All" Theory of Subrecursive Degrees is Decidable. %U http://dblp.uni-trier.de/db/conf/icalp/icalp74.html#Mehlhorn74 %V 14 %@ 3-540-06841-4

@inproceedings{conf/icalp/Mehlhorn74, added-at = {2017-05-19T00:00:00.000+0200}, author = {Mehlhorn, Kurt}, biburl = {https://www.bibsonomy.org/bibtex/278a1e82e30a7efdcc6d25131708fa51c/dblp}, booktitle = {ICALP}, crossref = {conf/icalp/1974}, editor = {Loeckx, Jacques}, ee = {https://doi.org/10.1007/3-540-06841-4_70}, interhash = {d6fcf063f380bb3278687c1c2f6cca67}, intrahash = {78a1e82e30a7efdcc6d25131708fa51c}, isbn = {3-540-06841-4}, keywords = {dblp}, pages = {317-325}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T16:25:59.000+0200}, title = {The "Almost All" Theory of Subrecursive Degrees is Decidable.}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp74.html#Mehlhorn74}, volume = 14, year = 1974 }