Computer Science – Theory and Applications, 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedingsсборник
Статьи, опубликованные в сборнике
2013
Improving on Gutfreund, Shaltiel, and Ta-Shma's Paper "If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances"
Vereshchagin Nikolay K.
в сборнике Computer Science – Theory and Applications, 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings , серия Lecture Notes in Computer Science , издательство SPRINGER-VERLAG BERLIN (HEIDELBERGER PLATZ 3, BERLIN, GERMANY,D-14197) , том 7913, с. 203-211
DOI
2013
Lower and Upper Bounds for the Length of Joins in the Lambek Calculus
Sorokin Alexey
в сборнике Computer Science – Theory and Applications, 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings , серия Lecture Notes in Computer Science , издательство SPRINGER-VERLAG BERLIN (HEIDELBERGER PLATZ 3, BERLIN, GERMANY,D-14197) , том 7913, с. 150-161
DOI