Mathematical Foundations of Computer Science 1981, J. Gruska; M. Chytil

Автор: Fuente, Angel de la.
Название: Mathematical methods and models for economists
ISBN: 0521585295 ISBN-13(EAN): 9780521585293
Издательство: Cambridge Academ
Рейтинг:
Цена: 8554.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book is intended as a textbook for a first-year PhD course in mathematics for economists and as a reference for graduate students in economics. It provides a self-contained, rigorous treatment of most of the concepts and techniques required to follow the standard first-year theory sequence in micro and macroeconomics.

Автор: A. Mazurkiewicz
Название: Mathematical Foundations of Computer Science 1976
ISBN: 3540078541 ISBN-13(EAN): 9783540078548
Издательство: Springer
Рейтинг:
Цена: 14673.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: J. Becvar
Название: Mathematical Foundations of Computer Science 1975
ISBN: 3540073892 ISBN-13(EAN): 9783540073895
Издательство: Springer
Рейтинг:
Цена: 11179.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Tramontano
Название: Introduction to Bioinformatics
ISBN: 1584885696 ISBN-13(EAN): 9781584885696
Издательство: Taylor&Francis
Рейтинг:
Цена: 12095.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: From the elucidation and analysis of a genomic sequence to the prediction of a protein structure and the identification of the molecular function, this book describes the rationale and limitations of the bioinformatics methods and tools that can help solve biological problems. It addresses the ways to store and retrieve biological data.

Автор: J. Winkowski
Название: Mathematical Foundations of Computer Science 1978
ISBN: 3540089217 ISBN-13(EAN): 9783540089216
Издательство: Springer
Рейтинг:
Цена: 13974.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Ludek Kucera; Anton?n Kucera
Название: Mathematical Foundations of Computer Science 2007
ISBN: 354074455X ISBN-13(EAN): 9783540744559
Издательство: Springer
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Cesku Krumlov, Czech Republic, August 26-31, 2007. This book presents 61 revised full papers with the full papers or abstracts of 5 invited talks were carefully reviewed and selected from 167 submissions.

Автор: Andrzej Tarlecki
Название: Mathematical Foundations of Computer Science 1991
ISBN: 3540543457 ISBN-13(EAN): 9783540543459
Издательство: Springer
Рейтинг:
Цена: 12157.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume contains the proceedings of a Polish/Czechoslovakian symposium on topics including parallel and distributed computing, software specification and development, logic and semantics of programs, algorithms, complexity and computability theory.

Автор: Igor Privara; Branislav Rovan; Peter Ruzicka
Название: Mathematical Foundations of Computer Science 1994
ISBN: 3540583386 ISBN-13(EAN): 9783540583387
Издательство: Springer
Рейтинг:
Цена: 16070.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume constitutes the proceedings of the 19th International Symposium on Mathematical Foundations in Theoretical Computer Science, held in Slovakia in August 1994. All areas of theoretical computer science are represented, with a particular emphasis on mathematical applications.

Автор: A. Blikle
Название: Mathematical Foundations of Computer Science 1974
ISBN: 3540071628 ISBN-13(EAN): 9783540071624
Издательство: Springer
Рейтинг:
Цена: 11179.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Ivan M. Havel; Vaclav Koubek
Название: Mathematical Foundations of Computer Science 1992
ISBN: 354055808X ISBN-13(EAN): 9783540558088
Издательство: Springer
Рейтинг:
Цена: 11179.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A collection of conference papers which includes discussion of graph layout problems, parallel recognition and ranking of context-free languages, the expansion of combinatorial polytopes, neural networks and complexity theory, methods in parallel algorithms and graph connectivity.

Автор: Ers?bet Csuhaj-Varj?; Martin Dietzfelbinger; Zolt?
Название: Mathematical Foundations of Computer Science 2014
ISBN: 3662445212 ISBN-13(EAN): 9783662445211
Издательство: Springer
Рейтинг:
Цена: 10062.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Table of Contents - Volume I.-Invited contributions.- Partial-Observation Stochastic Reachability and Parity Games.- Every graph is easy or hard: dichotomy theorems for graph problems.- Computer Poker and Computational Game Theory.- Random Deterministic Automata.- Communication Complexity Theory: Thirty-Five Years of Set Disjointness.- What does the local structure of a planar graph tell us about its global structure?.- Logic, Semantics, Automata and Theory of Programming.- Choiceless Polynomial Time on structures with small Abelian colour Classes.- Sofic-Dyck shifts.- A Logical Characterization of Timed (non-)Regular Languages.- Asymptotic Monadic Second-Order Logic.- Towards Efficient Reasoning Under Guarded-based Disjunctive Existential Rules.- Alternating Parity Krivine Automata.- Advances in Parametric Real-Time Reasoning.- Universal Lyndon Words.- Subword complexity and decomposition of the set of factors.- Cyclic Complexity of Words.- Classifying Recognizable Infinitary Trace Languages Using Word Automata.- Bounded variable logic, parameterized logarithmic space, and Savitch's Theorem.- An algebraic characterization of unary two-way transducers.- Size-Change Abstraction and Max-Plus Automata.- Alternating Vector Addition Systems with States.- Information Rate of Some Classes of Non-regular Languages: An Automata-theoretic Approach.- Relating Nominal and Higher-Order Rewriting.- Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures.- Two Recursively Inseparable Problems for Probabilistic Automata.- Monadic Second-Order Logic with Arbitrary Monadic Predicates.- Transforming two-way alternating finite automata to one-way nondeterministic automata.- Measure Properties of Game Tree Languages.- On Upper and Lower Bounds on the Length of Alternating Towers.- LaxF: Side Conditions and External Evidence as Monads.- The monoid of queue actions.- Undecidable properties of self-affine sets and multi-tape automata.- Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality.- A Unifying Approach for Multistack Pushdown Automata.- Definability and Transformations for Cost Logics and Automatic Structures.- Generalised Lyndon-Schьtzenberger Equations.- Complexity of Equivalence and Learning for Multiplicity Tree Automata.- Monadic datalog and regular tree pattern queries.- Model Checking Concurrent Recursive Programs using Temporal Logics.- Decidability of the interval temporal logic AABB over the rationals.- Reachability in Pushdown Register Automata.- A Generalization of the Los-Tarski Preservation Theorem over Classes of Finite Structures.- Determinising Parity Automata.- Tight Bounds for Complementing Parity Automata.- On Infinite Words Determined by Indexed Languages.- A Pumping Lemma for Two-Way Finite Transducers.- Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems.- The Dynamic Descriptive Complexity of k-Clique.

Автор: Giuseppe F. Italiano; Giovanni Pighizzini; Donald
Название: Mathematical Foundations of Computer Science 2015
ISBN: 3662480530 ISBN-13(EAN): 9783662480533
Издательство: Springer
Рейтинг:
Цена: 10062.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015.