an:05276680
Zbl 1136.68005
Hirsch, Edward A.; Razborov, Alexander A.; Semenov, Alexei; Slissenko, Anatol
Computer science -- theory and applications. Third international computer science symposium in Russia, CSR 2008 Moscow, Russia, June 7--12, 2008. Proceedings
EN
Lecture Notes in Computer Science 5010. Berlin: Springer (ISBN 978-3-540-79708-1/pbk). xiii, 411~p. (2008).
0302-9743 1611-3349
2008
b
68-06 68Qxx 00B25
The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1135.68001).
Indexed articles:
\textit{Wigderson, Avi}, Randomness -- a computational complexity perspective, 1-2 [Zbl 1142.68357]
\textit{Allender, Eric}, Cracks in the defenses: Scouting out approaches on circuit lower bounds, 3-10 [Zbl 1142.68363]
\textit{Khasidashvili, Zurab}, On formal equivalence verification of hardware, 11-12 [Zbl 1142.68436]
\textit{Pudlák, Pavel}, Twelve problems in proof complexity, 13-27 [Zbl 1142.03369]
\textit{Artemov, Sergei; Nogina, Elena}, Topological semantics of justification logic, 30-39 [Zbl 1138.03015]
\textit{Arvind, Vikraman; Das, Bireswar; Köbler, Johannes}, A logspace algorithm for partial 2-tree canonization, 40-51 [Zbl 1142.68368]
\textit{Avron, Arnon; Zamansky, Anna}, A triple correspondence in canonical calculi: Strong cut-elimination, coherence, and non-deterministic semantics, 52-63 [Zbl 1143.03028]
\textit{Babenko, Maxim A.; Starikovskaya, Tatiana A.}, Computing longest common substrings via suffix arrays, 64-75 [Zbl 1142.68592]
\textit{Bedon, Nicolas; Bès, Alexis; Carton, Olivier; Rispal, Chloé}, Logic and rational languages of words indexed by linear orderings, 76-85 [Zbl 1142.03346]
\textit{Bläser, Markus; Dell, Holger; Makowsky, Johann A.}, Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions, 86-98 [Zbl 1143.05023]
\textit{Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa; Oudalov, Vladimir}, A complete characterization of Nash-solvability of bimatrix games in terms of the exclusion of certain \(2\times 2\) subgames, 99-109 [Zbl 1143.91308]
\textit{Caucal, Didier; Hassen, Stéphane}, Synchronization of grammars, 110-121 [Zbl 1142.68413]
\textit{Cherukhin, Dmitriy Yu.}, Lower bounds for depth-2 and depth-3 Boolean circuits with arbitrary gates, 122-133 [Zbl 1142.68364]
\textit{Lago, Ugo Dal; Hofmann, Martin}, A semantic proof of polytime soundness of light affine logic, 134-145 [Zbl 1142.68360]
\textit{Deviatov, Rostislav}, On subword complexity of morphic sequences, 146-157 [Zbl 1142.68464]
\textit{Fiala, Jiří; Paulusma, Daniël}, Comparing universal covers in polynomial time, 158-167 [Zbl 1142.68456]
\textit{Fitting, Melvin}, S4LP and local realizability, 168-179 [Zbl 1143.03009]
\textit{Flarup, Uffe; Lyaudet, Laurent}, On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (extended abstract), 180-193 [Zbl 1142.68350]
\textit{Formenti, Enrico; Kari, Jarkko; Taati, Siamak}, The most general conservation law for a cellular automaton, 194-203 [Zbl 1142.68443]
\textit{Ganguly, Sumit}, Lower bounds on frequency estimation of data streams (extended abstract), 204-215 [Zbl 1142.68331]
\textit{Köbler, Johannes; Verbitsky, Oleg}, From invariants to canonization in parallel, 216-227 [Zbl 1142.68354]
\textit{Kuznets, Roman}, Self-referentiality of justified knowledge, 228-239 [Zbl 1143.03010]
\textit{Limaye, Nutan; Mahajan, Meena; Meyer, Antoine}, On the complexity of membership and counting in height-deterministic pushdown automata, 240-251 [Zbl 1142.68424]
\textit{Osin, Denis; Shpilrain, Vladimir}, Public key encryption and encryption emulation attacks, 252-260 [Zbl 1142.94356]
\textit{Podolskii, Vladimir V.}, A uniform lower bound on weights of perceptrons, 261-272 [Zbl 1142.94400]
\textit{Savateev, Yury}, Lambek grammars with one division are decidable in polynomial time, 273-282 [Zbl 1142.68415]
\textit{Shpilrain, Vladimir}, Cryptanalysis of Stickel's key exchange scheme, 283-288 [Zbl 1142.94360]
\textit{Shur, Arseny M.}, Combinatorial complexity of regular languages, 289-301 [Zbl 1142.68428]
\textit{V'yugin, Vladimir V.}, On sequences with non-learnable subsequences, 302-313 [Zbl 1142.68410]
\textit{Xiao, Mingyu}, Algorithms for multiterminal cuts, 314-325 [Zbl 1142.68462]
\textit{Zimand, Marius}, Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences, 326-338 [Zbl 1143.68020]
\textit{Bodyanskiy, Yevgeniy; Popov, Sergiy; Rybalchenko, Taras}, Multilayer neuro-fuzzy network for short term electric load forecasting, 339-348 [Zbl 1142.68468]
\textit{Kovács, Laura}, Invariant generation for P-solvable loops with assignments, 349-359 [Zbl 1142.68619]
\textit{Pan, Victor Y.; Ivolgin, Dmitriy; Murphy, Brian; Rosholt, Rhys Eric; Tang, Yuqing; Yan, Xiaodong}, Additive preconditioning for matrix computations, 372-383 [Zbl 1142.68607]
\textit{Pavlovic, Dusko}, Network as a computer: Ranking paths to find flows, 384-397 [Zbl 1142.68316]
\textit{Rebout, Maxime; Féraud, Louis; Soloviev, Sergei}, A unified categorical approach for attributed graph rewriting, 398-409 [Zbl 1142.68414]
1135.68001