000 | 04530nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-642-13182-0 | ||
003 | DE-He213 | ||
005 | 20240423125626.0 | ||
007 | cr nn 008mamaa | ||
008 | 100612s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642131820 _9978-3-642-13182-0 |
||
024 | 7 |
_a10.1007/978-3-642-13182-0 _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] : _b5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010, Proceedings / _cedited by Farid M. Ablaev, Ernst W. Mayr. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_aXI, 397 p. 49 illus. _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 ; _v6072 |
|
505 | 0 | _aAlgorithms for Energy Management -- Sofic and Almost of Finite Type Tree-Shifts -- Proof-Based Design of Security Protocols -- Approximating the Minimum Length of Synchronizing Words Is Hard -- Realizability of Dynamic MSC Languages -- The max quasi-independent set Problem -- Equilibria in Quantitative Reachability Games -- Quotient Complexity of Closed Languages -- Right-Sequential Functions on Infinite Words -- Kernelization -- Zigzags in Turing Machines -- Frameworks for Logically Classifying Polynomial-Time Optimisation Problems -- Validating the Knuth-Morris-Pratt Failure Function, Fast and Online -- Identical Relations in Symmetric Groups and Separating Words with Reversible Automata -- Time Optimal d-List Colouring of a Graph -- The Cantor Space as a Generic Model of Topologically Presented Knowledge -- Algorithmics – Is There Hope for a Unified Theory? -- Classifying Rankwidth k-DH-Graphs -- Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms -- A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem -- Balancing Bounded Treewidth Circuits -- Obtaining Online Ecological Colourings by Generalizing First-Fit -- Classical Simulation and Complexity of Quantum Computations -- Prefix-Free and Prefix-Correct Complexities with Compound Conditions -- Monotone Complexity of a Pair -- Symbolic Models for Single-Conclusion Proof Logics -- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA -- Advancing Matrix Computations with Randomized Preprocessing -- Transfinite Sequences of Constructive Predicate Logics -- The Quantitative Analysis of User Behavior Online — Data, Models and Algorithms -- A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.-Complexity of Propositional Proofs -- Quantization of Random Walks: Search Algorithms and Hitting Time -- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems -- Growth of Power-Free Languages over Large Alphabets -- A Partially Synchronizing Coloring -- An Encoding Invariant Version of Polynomial Time Computable Distributions -- Prehistoric Phenomena and Self-referentiality. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aMachine theory. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
700 | 1 |
_aAblaev, Farid M. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aMayr, Ernst W. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642131813 |
776 | 0 | 8 |
_iPrinted edition: _z9783642131837 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6072 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-13182-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c180005 _d180005 |