✦ LIBER ✦

[Lecture Notes in Computer Science] Computer Science – Theory and Applications Volume 6651 || Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity

✍ Scribed by Kulikov, Alexander; Vereshchagin, Nikolay

Book ID: 121000140
Publisher: Springer Berlin Heidelberg
Year: 2011
Tongue: English
Weight: 246 KB
Edition: 1
Category: Article
ISBN: 364220712X
DOI: 10.1007/978-3-642-20712-9_2

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2003 Volume 2747 || Towards a Theory of Randomized Search Heuristics

✍ Rovan, Branislav; Vojtáš, Peter 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 232 KB

This Book Constitutes The Refereed Proceedings Of The 28th International Symposium On Mathematical Foundations Of Computer Science, Mfcs 2003, Held In Bratislava, Slovakia In August 2003. The 55 Revised Full Papers Presented Together With 7 Invited Papers Were Carefully Reviewed And Selected From 13

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Science - Theory and Applications Volume 5675 || Concatenation of Regular Languages and Descriptional Complexity

✍ Frid, Anna; Morozov, Andrey; Rybalchenko, Andrey; Wagner, Klaus W. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 272 KB

[Lecture Notes in Computer Science] Lang

[Lecture Notes in Computer Science] Language and Automata Theory and Applications Volume 7183 || A Parameterized Complexity Tutorial

✍ Dediu, Adrian-Horia; Martín-Vide, Carlos 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 291 KB

This Book Constitutes The Refereed Proceedings Of The 6th International Conference On Language And Automata Theory And Applications, Lata 2012, Held In A Coruña, Spain In March 2012. The 41 Revised Full Papers Presented Together With 3 Invited Talks And 2 Invited Tutorials Were Carefully Reviewed An

[Lecture Notes in Computer Science] Lang

[Lecture Notes in Computer Science] Language and Automata Theory and Applications Volume 6638 || Descriptional Complexity of Unambiguous Nested Word Automata

✍ Dediu, Adrian-Horia; Inenaga, Shunsuke; Martín-Vide, Carlos 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 224 KB

[Lecture Notes in Computer Science] Info

[Lecture Notes in Computer Science] Information Theory, Combinatorics, and Search Theory Volume 7777 || A Heuristic Solution of a Cutting Problem Using Hypergraphs

✍ Aydinian, Harout; Cicalese, Ferdinando; Deppe, Christian 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 336 KB

[Lecture Notes in Computer Science] Theo

[Lecture Notes in Computer Science] Theory and Applications of Models of Computation Volume 6648 || Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication

✍ Ogihara, Mitsunori; Tarui, Jun 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 252 KB