05098nam 22008055 450 99646609450331620230405223611.03-540-74510-610.1007/978-3-540-74510-5(CKB)1000000000490432(SSID)ssj0000316895(PQKBManifestationID)11276962(PQKBTitleCode)TC0000316895(PQKBWorkID)10286376(PQKB)11525568(DE-He213)978-3-540-74510-5(MiAaPQ)EBC3063186(MiAaPQ)EBC6711198(Au-PeEL)EBL6711198(OCoLC)184940636(PPN)123164605(EXLCZ)99100000000049043220100301d2007 u| 0engurnn#008mamaatxtccrComputer Science - Theory and Applications[electronic resource] Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings /edited by Volker Diekert, Mikhail Volkov, Andrei Voronkov1st ed. 2007.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2007.1 online resource (XIII, 420 p.)Theoretical Computer Science and General Issues,2512-2029 ;4649Bibliographic Level Mode of Issuance: Monograph3-540-74509-2 Includes bibliographical references and index.Proving Church’s Thesis -- The Limits of Quantum Computers -- Marrying Words and Trees -- TPTP, TSTP, CASC, etc. -- Abstract Modeling and Formal Verification of Microprocessors -- Sequences of Level 1, 2, 3,..., k,... -- Timers and Proximities for Mobile Ambients -- Pushing Random Walk Beyond Golden Ratio -- Reversible Machine Code and Its Abstract Processor Architecture -- A Fast Algorithm for Path 2-Packing Problem -- Decidability of Parameterized Probabilistic Information Flow -- Inverting Onto Functions and Polynomial Hierarchy -- Proved-Patterns-Based Development for Structured Programs -- Planarity, Determinants, Permanents, and (Unique) Matchings -- Equivalence Problems for Circuits over Sets of Natural Numbers -- Bouillon: A Wiki-Wiki Social Web -- A PDL-Like Logic of Knowledge Acquisition -- Resource Placement in Networks Using Chromatic Sets of Power Graphs -- Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth -- Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems -- New Bounds for MAX-SAT by Clause Learning -- Towards Hierarchical Clustering (Extended Abstract) -- Estimation of the Click Volume by Large Scale Regression Analysis -- Maximal Intersection Queries in Randomized Graph Models -- A Note on Specialization of Interpreters -- Efficient Computation in Groups Via Compression -- Constructing a Secret Binary Partition of a Digital Image Robust to a Loss of Synchronization -- On the Complexity of Matrix Rank and Rigidity -- On the Usage of Clustering for Content Based Image Retrieval -- Performance Modeling of Wormhole Hypermeshes Under Hotspot Traffic -- Application of Modified Coloured Petri Nets to Modeling and Verification of SDL Specified Communication Protocols -- Symmetry of Information and Nonuniform Lower Bounds -- Perceptrons of Large Weight -- A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes -- Kolmogorov Complexity, Lovász Local Lemma and Critical Exponents -- Generic Complexity of Presburger Arithmetic -- Everywhere ?-Repetitive Sequences and Sturmian Words -- Timed Traces and Strand Spaces -- On Empirical Meaning of Randomness with Respect to a Real Parameter -- An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity -- Generic Complexity of Undecidable Problems.Theoretical Computer Science and General Issues,2512-2029 ;4649Computer scienceAlgorithmsArtificial intelligenceComputer science—MathematicsBioinformaticsTheory of ComputationAlgorithmsArtificial IntelligenceMathematics of ComputingBioinformaticsComputer science.Algorithms.Artificial intelligence.Computer science—Mathematics.Bioinformatics.Theory of Computation.Algorithms.Artificial Intelligence.Mathematics of Computing.Bioinformatics.004.0947Voronkov Andrei1959-Diekert Volker1955-Volkov Mikhail V.International Computer Science Symposium in RussiaMiAaPQMiAaPQMiAaPQBOOK996466094503316Computer Science - Theory and Applications2889860UNISA