000 04650nam a22005655i 4500
001 978-3-642-38536-0
003 DE-He213
005 20200421111158.0
007 cr nn 008mamaa
008 130604s2013 gw | s |||| 0|eng d
020 _a9783642385360
_9978-3-642-38536-0
024 7 _a10.1007/978-3-642-38536-0
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aComputer Science - Theory and Applications
_h[electronic resource] :
_b8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings /
_cedited by Andrei A. Bulatov, Arseny M. Shur.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXII, 445 p. 55 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7913
505 0 _aThe Lovasz Local Lemma - A Survey -- An Improved Knapsack Solver for Column Generation -- QuickHeapsort: Modifications and Improved Analysis -- Alphabetic Minimax Trees in Linear Time -- Decidability and Enumeration for Automatic Sequences: A Survey -- Walking on Data Words -- Careful Synchronization of Partial Automata with Restricted Alphabets -- Random Generation of Deterministic Acyclic Automata Using the Recursive Method -- Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height -- A Short Tutorial on Order-Invariant First-Order Logic -- Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams -- Parameterized Resolution with Bounded Conjunction -- Lower and Upper Bounds for the Length of Joins in the Lambek Calculus -- Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP -- Towards NEXP versus BPP? -- Information Lower Bounds via Self-reducibility -- On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles -- 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" -- Amortized Communication Complexity of an Equality Predicate -- On Coloring of Sparse Graphs -- On Recognizing Words That Are Squares for the Shuffle Product -- Cyclic Shift on Prefix-Free Languages -- Weak Abelian Periodicity of Infinite Words -- Universality of Regular Realizability Problems -- Potential Functions in Strategic Games -- The Probabilistic Min Dominating Set Problem -- Dichotomy of the H-Quasi-Cover Problem -- QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability -- Quantum Alternation -- Real Numbers, Chaos, and the Principle of a Bounded Density of Information -- Random Selection in Few Rounds -- One-Counter Verifiers for Decidable Languages -- More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding -- Composition with Algebra at the Background -- Model-Checking Bounded Multi-Pushdown Systems -- Multi-weighted Automata and MSO Logic -- Overlapping Tile Automata.
520 _aThis book constitutes the proceedings of the 8th International Computer Science Symposium in Russia, CSR 2013, held in Ekaterinburg, Russia, in June 2013. The 29 full papers presented in this volume were carefully reviewed and selected from 52 submissions. In addition the book contains 8 invited lectures. The papers are organized in topical sections on: algorithms; automata; logic and proof complexity; complexity; words and languages; and logic and automata.
650 0 _aComputer science.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aBulatov, Andrei A.
_eeditor.
700 1 _aShur, Arseny M.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642385353
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7913
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-38536-0
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c53655
_d53655