Sgall jiri (26 Ergebnisse)

Cloth fest gebunden. Zustand: Gut. 376 S. Guter Zustand/ Good Ex-Library. As library copy in very good condition. Sprache: Französisch Gewicht in Gramm: 811.

Hardcover. Zustand: Gut. vi, 376 S. Gebrauchtes Buch aus ehem. Privatbesitz. GUTER Zustand, wenige Gebrauchsspuren. Used book, few traces of use. C07317 9027254443 Sprache: Englisch Gewicht in Gramm: 550.

Zustand: New. In English.

Zustand: Gut. 824 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7933 9783642220050 Sprache: Englisch Gewicht in Gramm: 900.

Zustand: New. In English.

Bibl.Ex., keine Markierungen-Unterstreichungen-Anmerkungen im Text, Format groß 8°, 716 Seiten, broschiert, Stempel Vorsatz/Kopfschnitt, sonst wie neu. Shipping to abroad insured with tracking number.

Paperback. Zustand: Brand New. 148 pages. 9.25x6.10x0.34 inches. In Stock.

Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the Second IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2017, held in Tehran, Iran, in September 2017. The 8 papers presented in this volume were carefully reviewed and selected from 20 submissions. They were organized in topical sections named: algorithms and complexity; and logic, semantics, and programming theory.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.…

Zustand: Fine. Cestina bez prikras - Sgall, Petr & Hronek, Jiri *** [EN] Categories: Languages & Linguistics | Condition: flawless *** [DE] Kategorien: Sprachen, Linguistik | Zustand: einwandfrei *** [CZ] Kategorie: Jazyky, lingvistika | Stav: Bezvadny.

Taschenbuch. Zustand: Neu. Mathematical Foundations of Computer Science 2013 | 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings | Krishnendu Chatterjee (u. a.) | Taschenbuch | xvi | Englisch | 2013 | Springer | EAN 9783642403125 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

paperback. Zustand: Gut. 740 Seiten; 9783540424963.3 Gewicht in Gramm: 2.

Hardcover. Zustand: Brand New. 293 pages. In Stock.

Hardcover. Zustand: Brand New. 382 pages. In Stock.

Zustand: New. In English.

Zustand: New. In English.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 868 | Sprache: Englisch | Produktart: Bücher | This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Talks.- A New Category for Semantics.- On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity.- Playing Games with Algorithms: Algorithmic Combinatorial Game Theory.- Some Recent Results on Data Mining and Search.- Hypertree Decompositions: A Survey.- The Strength of Non-size-increasing Computation (Introduction and Summary).- to Recent Quantum Algorithms.- Decomposition Methods and Sampling Circuits in the Cartesian Lattice.- New Algorithms for k-SAT Based on the Local Search Principle.- Linear Temporal Logic and Finite Semigroups.- Contributed Talks.- Refined Search Tree Technique for Dominating Set on Planar Graphs.- The Computational Power of a Family of Decision Forests.- Exact Results for Accepting Probabilities of Quantum Automata.- Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms.- Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.- The Complexity of Tensor Circuit Evaluation.- Computing Reciprocals of Bivariate Power Series.- Automatic Verification of Recursive Procedures with One Integer Parameter.- Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds.- Computable Versions of Baire's Category Theorem.- Automata on Linear Orderings.- Algorithmic Information Theory and Cellular Automata Dynamics.- The k-Median Problem for Directed Trees.- On Pseudorandom Generators in NC0.- There Are No Sparse NPw-Hard Sets.- Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio.- (H,C,K) -Coloring: Fast, Easy, and Hard Cases.- Randomness and Reductibility.- On the Computational Complexity of Infinite Words.- Lower Bounds for On-Line Single-Machine Scheduling.- Approximation Algorithms and Complexity Results forPath Problems in Trees of Rings.- A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing.- Quantifier Rank for Parity of Embedded Finite Models.- Space Hierarchy Theorem Revised.- Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.- The Complexity of the Minimal Polynomial.- Note on Minimal Finite Automata.- Synchronizing Finite Automata on Eulerian Digraphs.- A Time Hierarchy for Bounded One-Way Cellular Automata.- Checking Amalgamability Conditions forCasl Architectural Specifications.- On-Line Scheduling with Tight Deadlines.- Complexity Note on Mixed Hypergraphs.- News from the Online Traveling Repairman.- Word Problems for 2-Homogeneous Monoids and Symmetric Logspace.- Variations on a Theorem of Fine & Wilf.- Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.- Satisfiability of Systems of Equations over Finite Monoids.- Rational Graphs Trace Context-Sensitive Languages.- Towards Regular Languages over Infinite Alphabets.- Partial Information and Special Case Algorithms.- The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.- From Bidirectionality to Alternation.- Syntactic Semiring of a Language.- On Reducibility and Symmetry of Disjoint NP-Pairs.- Hierarchy of Monotonically Computable Real Numbers.- On the Equational Definition of the Least Prefixed Point.- On the Periods of Partial Words.- The Size of Power Automata.- On the Approximability of the Steiner Tree Problem.- Alignment between Two RNA Structures.- Characterization of Context-Free Languages with Polynomially Bounded Ambiguity.…

Paperback. Zustand: Brand New. 2011 edition. 692 pages. 9.29x6.14x1.50 inches. In Stock.

Paperback. Zustand: Brand New. 2011 edition. 826 pages. 9.29x6.14x1.73 inches. In Stock.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 666 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Taschenbuch. Zustand: Neu. Neuware - The two-volume set LNCS 6755 and LNCS 6756 constitutes the refereed proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, held in Zürich, Switzerland, in July 2011. The 114 revised full papers (68 papers for track A, 29 for track B, and 17 for track C) presented together with 4 invited talks, 3 best student papers, and 3 best papers were carefully reviewed and selected from a total of 398 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. …

181 S., 8°, Obrosch, Vorwort von den Autoren, Sprache: Tschechisch, guter Zustand.

Zustand: New. pp. xxiv + 802.

Zustand: gut. 2008. Mathematical Foundations of Computer Science 2001: 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001 . Notes in Computer Science, 2136, Band 2136) In deutscher Sprache. pages.