LEADER 06855nam 22007695 450 001 996465792003316 005 20200706071422.0 010 $a3-540-44669-9 024 7 $a10.1007/3-540-44669-9 035 $a(CKB)1000000000211547 035 $a(SSID)ssj0000323378 035 $a(PQKBManifestationID)11243261 035 $a(PQKBTitleCode)TC0000323378 035 $a(PQKBWorkID)10296687 035 $a(PQKB)11115883 035 $a(DE-He213)978-3-540-44669-9 035 $a(MiAaPQ)EBC3072128 035 $a(PPN)155185195 035 $a(EXLCZ)991000000000211547 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFundamentals of Computation Theory$b[electronic resource] $e13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings /$fedited by Rusins Freivalds 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XIV, 550 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2138 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42487-3 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Towards Axiomatic Basis of Inductive Inference -- Approximation Algorithms for Fractional Covering and Packing Problems, and Applications -- Challenges of Commutation -- Approximating Bounded Degree Instances of NP-Hard Problems -- Universal Algebra and Computer Science -- Quantum Algorithms -- Regular Papers -- A Discrete Approximation and Communication Complexity Approach to the Superposition Problem -- On Computational Power of Quantum Branching Programs -- Efficient Computation of Singular Moduli with Application in Cryptography -- Ambainis-Freivalds? Algorithm for Measure-Once Automata -- Are There Essentially Incomplete Knowledge Representation Systems? -- Best Increments for the Average Case of Shellsort -- Approximating Minimum Cocolourings -- Curved Edge Routing -- Time/Space Efficient Compressed Pattern Matching -- Modelling Change with the Aid of Knowledge and Time -- If P ? NP then Some Strongly Noninvertible Functions Are Invertible -- Prediction-Preserving Reducibility with Membership Queries on Formal Languages -- Dense Families and Key Functions of Database Relation Instances -- On the Complexity of Decidable Cases of Commutation Problem for Languages -- Cones, Semi-AFPs, and AFPs of Algebraic Power Series -- New Small Universal Circular Post Machines -- Divisibility Monoids: Presentation, Word Problem, and Rational Languages -- Concurrency in Timed Automata -- How Powerful Are Infinite Time Machines? -- Equivalence Problem of Composite Class Diagrams -- Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2 -- On the Category of Event Structures with Dense Time -- Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions -- Monte-Carlo Polynomial versus Linear Time - The Truth-Table Case -- Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies -- Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables -- Piecewise and Local Threshold Testability of DFA -- Compositional Homomorphisms of Relational Structures -- Short Papers -- Representation of Autonomous Automata -- Quantum Reversibility and a New Model of Quantum Automaton -- Space-Efficient 1.5-Way Quantum Turing Machine -- A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain -- A Primitive for Proving the Security of Every Bit and about Universal Hash Functions & Hard Core Bits -- Pythagorean Triples in Unification Theory of Nilpotent Rings -- Two-States Bilinear Intrinsically Universal Cellular Automata -- Linear Time Recognizer for Subsets of ?2 -- Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents -- On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z3 ; + ) -- Quantum Real - Time Turing Machine -- Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control -- Linear Automata and Recognizable Subsets in Free Semirings -- On Logical Method for Counting Dedekind Numbers -- A General Method for Graph Isomorphism -- WEA Invited Papers -- Designing PTASs for MIN-SUM Scheduling Problems -- On Robust Algorithms for the Maximum Weight Stable Set Problem -- Multicasting in Optical Networks -- WEA Regular Papers -- Structured Randomized Rounding and Coloring -- Optimal Online Flow Time with Resource Augmentation -- New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs -- On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks -- Approximation Algorithms for Time-Dependent Orienteering -- On Complexity of Colouring Mixed Hypertrees -- Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems -- The Complexity of Maximum Matroid-Greedoid Intersection. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2138 606 $aComputers 606 $aComputer programming 606 $aAlgorithms 606 $aMathematical logic 606 $aComputer graphics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputers. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aMathematical logic. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aProgramming Techniques. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aMathematical Logic and Formal Languages. 615 24$aComputer Graphics. 676 $a004 702 $aFreivalds$b Rusins$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aFCT 2001 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465792003316 996 $aFundamentals of computation theory$9382778 997 $aUNISA