Mathematical Foundations of Computer Science 1988, Michal P. Chytil; Ladislav Janiga; Vaclav Koubek

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

Автор: Igor Privara; Peter Ruzicka
Название: Mathematical Foundations of Computer Science 1997
ISBN: 3540634371 ISBN-13(EAN): 9783540634379
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains the proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS `97. The papers cover a range of theoretical computer science including programming theory, complexity theory, mathematical logic, rewriting, grammars and formal languages.

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

Автор: B.Xiong,P.Yee Lee
Название: Mathematical olympiad in China (2009-2010)
ISBN: 9814390216 ISBN-13(EAN): 9789814390217
Издательство: World Scientific Publishing
Рейтинг:
Цена: 25350.00 T
Наличие на складе: Невозможна поставка.
Описание: The International Mathematical Olympiad (IMO) is a competition for high school students. China has taken part in the IMO 21 times since 1985 and has won the top ranking for countries 14 times. This title comprises of original problems with solutions that China used to train their Olympiad team in the years from 2009 to 2010.

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

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

Автор: J. Gruska; M. Chytil
Название: Mathematical Foundations of Computer Science 1981
ISBN: 3540108564 ISBN-13(EAN): 9783540108566
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Lubos Brim; Josef Gruska; Jiri Zlatuska
Название: Mathematical Foundations of Computer Science 1998
ISBN: 3540648275 ISBN-13(EAN): 9783540648277
Издательство: Springer
Рейтинг:
Цена: 107130.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: J. Gruska
Название: Mathematical Foundations of Computer Science 1977
ISBN: 3540083537 ISBN-13(EAN): 9783540083535
Издательство: Springer
Рейтинг:
Цена: 97820.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: M.P. Chytil; V. Koubek
Название: Mathematical Foundations of Computer Science 1984
ISBN: 3540133720 ISBN-13(EAN): 9783540133728
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Jiri Sgall; Ales Pultr; Petr Kolman
Название: Mathematical Foundations of Computer Science 2001
ISBN: 3540424962 ISBN-13(EAN): 9783540424963
Издательство: Springer
Рейтинг:
Цена: 111790.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This title explores all current aspects of theoretical computer science ranging from mathematical logic and programming theory to algorithms, discrete mathematics, and complexity theory. Besides classical issues, modern topics like quantum computing are discussed as well.

Автор: Antoni Kreczmar; Grazyna Mirkowska
Название: Mathematical Foundations of Computer Science 1989
ISBN: 3540514864 ISBN-13(EAN): 9783540514862
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS `89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989.