Computer Science -- Theory and Applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010, Proceedings - neues Buch

EAN (ISBN-13): 9783642131820
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2015-11-29T20:01:59+01:00 (Berlin)
Detailseite zuletzt geändert am 2022-03-07T09:49:45+01:00 (Berlin)
ISBN/EAN: 9783642131820

ISBN - alternative Schreibweisen:
978-3-642-13182-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: mayr ernst, winkelnkemper
Titel des Buches: computer applications

---

Daten vom Verlag:

Autor/in: Farid M. Ablaev; Ernst W. Mayr
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Computer Science -- Theory and Applications - 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010, Proceedings
Verlag: Springer; Springer Berlin
397 Seiten
Erscheinungsjahr: 2010-06-14
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XI, 397 p. 49 illus.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Alphabet; Erfüllbarkeitsproblem der Aussagenlogik; Graph; algorithmics; algorithms; automata; complexity; computability; constraint satisfaction problem; maximum spanning tree; optimization; quantum computation; security protocols; theoretical computer science; turing machine; algorithm analysis and problem complexity; C; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Discrete Mathematics in Computer Science; Computer Science; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; BC

Algorithms 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.