Computer Science – Theory and Applications [[electronic resource] ] : 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings / / edited by Alexander Kulikov, Nikolay Vereshchagin

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
• Edizione: 1st ed. 2011.
• Descrizione fisica: 1 online resource (XI, 471 p.)
• Disciplina: 005.1
• Soggetto topico: Algorithms; Computer science; Machine theory; Computer science—Mathematics; Discrete mathematics; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Discrete Mathematics in Computer Science; Theory of Computation; Mathematics of Computing
• Soggetto geografico: Russia (Federation)
• Soggetto genere / forma: Conference papers and proceedings.
• Persona (resp. second.): KulikovAlexander; VereshchaginNikolay
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: The equivalence of sampling and searching / Scott Aaronson -- Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity / Benjamin Doerr, Carola Winzen.
• Sommario/riassunto: This book constitutes the proceedings of the 6th International Computer Science Symposium in Russia, CSR 2011, held in St. Petersburg, Russia, in June 2011. The 29 papers presented were carefully reviewed and selected from 76 submissions. The scope of topics of the symposium was quite broad and covered basically all areas of the foundations of theoretical computer science.
• Titolo autorizzato: Computer Science - Theory and Applications
• ISBN: 3-642-20712-X
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465337103316
• Lo trovi qui: Univ. di Salerno
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 6651