000 05851nam a22006255i 4500
001 978-3-540-79709-8
003 DE-He213
005 20240423125931.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540797098
_9978-3-540-79709-8
024 7 _a10.1007/978-3-540-79709-8
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aComputer Science - Theory and Applications
_h[electronic resource] :
_bThird International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings /
_cedited by Edward A. Hirsch, Alexander A. Razborov, Alexei Semenov, Anatol Slissenko.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXIII, 411 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5010
505 0 _aOpening Lecture -- Randomness – A Computational Complexity Perspective -- Invited Papers -- Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds -- On Formal Equivalence Verification of Hardware -- Twelve Problems in Proof Complexity -- Manifestation and Exploitation of Invariants in Bioinformatics -- Simple Stochastic Games, Mean Payoff Games, Parity Games -- Theory Track -- Topological Semantics of Justification Logic -- A Logspace Algorithm for Partial 2-Tree Canonization -- A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics -- Computing Longest Common Substrings Via Suffix Arrays -- Logic and Rational Languages of Words Indexed by Linear Orderings -- Complexity of the Bollobás-Riordan Polynomial -- A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames -- Synchronization of Grammars -- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates -- A Semantic Proof of Polytime Soundness of Light Affine Logic -- On Subword Complexity of Morphic Sequences -- Comparing Universal Covers in Polynomial Time -- S4LP and Local Realizability -- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) -- The Most General Conservation Law for a Cellular Automaton -- Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract) -- From Invariants to Canonization in Parallel -- Self-referentiality of Justified Knowledge -- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata -- Public Key Encryption and Encryption Emulation Attacks -- A Uniform Lower Bound on Weights of Perceptrons -- Lambek Grammars with One Division Are Decidable inPolynomial Time -- Cryptanalysis of Stickel’s Key Exchange Scheme -- Combinatorial Complexity of Regular Languages -- On Sequences with Non-learnable Subsequences -- Algorithms for Multiterminal Cuts -- Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences -- Applications and Technology Track -- Multilayer Neuro-fuzzy Network for Short Term Electric Load Forecasting -- Invariant Generation for P-Solvable Loops with Assignments -- Using Coloured Petri Nets to Model and Verify Telecommunications Systems -- Additive Preconditioning for Matrix Computations -- Network as a Computer: Ranking Paths to Find Flows -- A Unified Categorical Approach for Attributed Graph Rewriting.
520 _aThis book constitutes the refereed proceedings of the Third International Computer Science Symposium in Russia, CSR 2008, held in Moscow, Russia, June 7-12, 2008. The 33 revised papers presented together with 5 invited papers and one opening lecture were carefully reviewed and selected from 103 submissions. All major areas in computer science are addressed. The theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory and applications of logic to computer science. The application part comprises programming and languages; computer architecture and hardware design; symbolic computing and numerical applications; application software; artificial intelligence and robotics.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence.
650 0 _aComputer science
_xMathematics.
650 0 _aBioinformatics.
650 1 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aArtificial Intelligence.
650 2 4 _aMathematics of Computing.
650 2 4 _aBioinformatics.
700 1 _aHirsch, Edward A.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRazborov, Alexander A.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSemenov, Alexei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSlissenko, Anatol.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540797081
776 0 8 _iPrinted edition:
_z9783540850106
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5010
856 4 0 _uhttps://doi.org/10.1007/978-3-540-79709-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c183260
_d183260