000 | 05891nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-44669-9 | ||
003 | DE-He213 | ||
005 | 20240423132458.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2001 gw | s |||| 0|eng d | ||
020 |
_a9783540446699 _9978-3-540-44669-9 |
||
024 | 7 |
_a10.1007/3-540-44669-9 _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 |
_aFundamentals of Computation Theory _h[electronic resource] : _b13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings / _cedited by Rusins Freivalds. |
250 | _a1st ed. 2001. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2001. |
|
300 |
_aXIV, 550 p. _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, _x1611-3349 ; _v2138 |
|
505 | 0 | _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 Complexityof Colouring Mixed Hypertrees -- Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems -- The Complexity of Maximum Matroid-Greedoid Intersection. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aComputer Graphics. |
700 | 1 |
_aFreivalds, Rusins. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540424871 |
776 | 0 | 8 |
_iPrinted edition: _z9783662167762 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2138 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-44669-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188210 _d188210 |