Alexei G. Myasnikov. Generic Complexity of Undecidable Problems. In Volker Diekert, Mikhail V. Volkov, Andrei Voronkov, editors, Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. Volume 4649 of Lecture Notes in Computer Science, pages 407-417, Springer, 2007. [doi]
@inproceedings{Myasnikov07,
title = {Generic Complexity of Undecidable Problems},
author = {Alexei G. Myasnikov},
year = {2007},
doi = {10.1007/978-3-540-74510-5_41},
url = {http://dx.doi.org/10.1007/978-3-540-74510-5_41},
researchr = {https://researchr.org/publication/Myasnikov07},
cites = {0},
citedby = {0},
pages = {407-417},
booktitle = {Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings},
editor = {Volker Diekert and Mikhail V. Volkov and Andrei Voronkov},
volume = {4649},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74509-9},
}