Foundations of Software Science and Computation Structures, Miko?aj Boja?czyk; Alex Simpson

Автор: Goldreich, Oded
Название: Foundations of cryptography: volume 2, basic applications
ISBN: 052111991X ISBN-13(EAN): 9780521119917
Издательство: Cambridge Academ
Рейтинг:
Цена: 60190.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Building on the basic tools presented in the first volume, this second volume of Foundations of Cryptography contains a rigorous and systematic treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols. It is suitable for use in a graduate course on cryptography and as a reference book for experts.

Автор: Luca de Alfaro
Название: Foundations of Software Science and Computational Structures
ISBN: 3642005950 ISBN-13(EAN): 9783642005954
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Contains topics that include semantics, logics and automata, algebras, automata theory, processes and models, security, probabilistic and quantitative models, synthesis, and program analysis and semantics.

Автор: Li, Fanzhang / Zhang, Li / Zhang, Zhao
Название: Dynamic Fuzzy Machine Learning
ISBN: 3110518708 ISBN-13(EAN): 9783110518702
Издательство: Walter de Gruyter
Рейтинг:
Цена: 149590.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Machine learning is widely used for data analysis. Dynamic fuzzy data are one of the most difficult types of data to analyse in the field of big data, cloud computing, the Internet of Things, and quantum information. At present, the processing of this kind of data is not very mature. The authors carried out more than 20 years of research, and show in this book their most important results. The seven chapters of the book are devoted to key topics such as dynamic fuzzy machine learning models, dynamic fuzzy self-learning subspace algorithms, fuzzy decision tree learning, dynamic concepts based on dynamic fuzzy sets, semi-supervised multi-task learning based on dynamic fuzzy data, dynamic fuzzy hierarchy learning, examination of multi-agent learning model based on dynamic fuzzy logic. This book can be used as a reference book for senior college students and graduate students as well as college teachers and scientific and technical personnel involved in computer science, artificial intelligence, machine learning, automation, data analysis, mathematics, management, cognitive science, and finance. It can be also used as the basis for teaching the principles of dynamic fuzzy learning.

Автор: Cook
Название: Logical Foundations of Proof Complexity
ISBN: 1107694116 ISBN-13(EAN): 9781107694118
Издательство: Cambridge Academ
Рейтинг:
Цена: 61240.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. The result is a uniform treatment of many systems in the literature.

Автор: Luke Ong
Название: Foundations of Software Science and Computational Structures
ISBN: 3642120318 ISBN-13(EAN): 9783642120312
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Includes the refereed proceedings of the 13th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2010, held in Paphos, Cyprus, in March 2010, as part of ETAPS 2010, the European Joint Conferences on Theory and Practice of Software.

Автор: M. Karpinski
Название: Foundations of Computation Theory
ISBN: 3540126899 ISBN-13(EAN): 9783540126898
Издательство: Springer
Рейтинг:
Цена: 43780.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Vasco Brattka, Hannes Diener, Dieter Spreen
Название: Logic, Computation, Hierarchies
ISBN: 1614517835 ISBN-13(EAN): 9781614517832
Издательство: Walter de Gruyter
Цена: 153660.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Published in honor of Victor L. Selivanov, the 17 articles collected in this volume inform on the latest developments in computability theory and its applications in computable analysis; descriptive set theory and topology; and the theory of omega-languages; as well as non-classical logics, such as temporal logic and paraconsistent logic. This volume will be of interest to mathematicians and logicians, as well as theoretical computer scientists.

Автор: Makowsky
Название: Logic Colloquium `95
ISBN: 1107167906 ISBN-13(EAN): 9781107167902
Издательство: Cambridge Academ
Рейтинг:
Цена: 136210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume presents the conference proceedings of the 1995 Annual European Summer Meeting of the Association of Symbolic Logic. The papers here cover all topics of classical mathematical logic. There is also a tutorial on recent developments in theoretical computer science, and plenary lectures on the foundation and evolution of set theory.

Автор: Baier
Название: Foundations of Software Science and Computation Structures
ISBN: 3319893653 ISBN-13(EAN): 9783319893655
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Semantics.- Non-angelic Concurrent Game Semantics.- A Trace Semantics for System F Parametric Polymorphism.- Categorical Combinatorics for Non Deterministic Strategies on Simple Games.- A Syntactic View of Computational Adequacy.- Linearity.- A New Linear Logic for Deadlock-Free Session-Typed Processes.- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads.- Depending on Session-Typed Processes.- FabULous Interoperability for ML and a Linear Language.- Concurrency.- Automata for True Concurrency Properties.- A Theory of Encodings and Expressiveness.- A Framework for Parameterized Monitorability.- Logics for Bisimulation and Divergence.- Lambda-Calculi and Types.- Call-by-need, Neededness and All That.- Fitch-Style Modal Lambda Calculi.- Realizability Interpretation and Normalization of Typed Call-by-Need.- Quotient Inductive-Inductive Types.- Category Theory and Quantum Control.- Guarded Traced Categories.- Proper Semirings and Proper Convex Functors.- From Symmetric Pattern-Matching to Quantum Control.- Quantitative Models.- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes.- A Hierarchy of Scheduler Classes for Stochastic Automata.- Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings.- Comparator Automata in Quantitative Verification.- Logics and Equational Theories.- Modular Tableaux Calculi for Separation Theories.- Differential Calculus with Imprecise Input and its Logical Framework.- The Effects of Adding Reachability Predicates in Propositional Separation Logic.- The Equational Theory of the Natural Join and of Inner Union is Decidable.- Graphs and Automata.- Minimization of Graph Weighted Models over Circular Strings.- Games on Graphs with a Public Signal Monitoring.- WQO Dichotomy for 3-Graphs.- Verifying Higher-Order Functions with Tree Automata.

Автор: Agarwal, Dr Basant, Baka, Benjamin
Название: Hands-On Data Structures and Algorithms with Python 2 ed
ISBN: 1788995570 ISBN-13(EAN): 9781788995573
Издательство: Неизвестно
Рейтинг:
Цена: 53940.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Data structures help us to organize and align the data in a very efficient way. This book will surely help you to learn important and essential data structures through Python implementation for better understanding of the concepts.

Автор: Watrous, John (university Of Waterloo, Ontario)
Название: The theory of quantum information
ISBN: 1107180562 ISBN-13(EAN): 9781107180567
Издательство: Cambridge Academ
Рейтинг:
Цена: 77090.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Intended for graduate students and researchers, this book presents a formal development of the mathematical theory of quantum information. Largely self-contained, with clear proofs and a wide range of exercises, it will help the reader grasp the fundamental facts and techniques that form the mathematical foundations of the subject.

Автор: Javier Esparza; Andrzej S. Murawski
Название: Foundations of Software Science and Computation Structures
ISBN: 3662544571 ISBN-13(EAN): 9783662544570
Издательство: Springer
Рейтинг:
Цена: 74530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Coherence Spaces and Higher-Order Computation.- Coherence Spaces and Uniform Continuity.- The Free Exponential Modality of Probabilistic Coherence Spaces.- From Qualitative to Quantitative Semantics by Change of Base.- Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.-Algebra and Coalgebra.- Algebra, coalgebra, and minimization in polynomial differential equations.- Equational Theories of Abnormal Termination Based on Kleene Algebra.- Companions, Codensity and Causality.- Nominal Automata with Name Binding.- Games and Automata.- On the existence of weak subgame perfect equilibria.- Optimal Reachability in Divergent Weighted Timed Games.- Bounding Average-energy Games.- Logics of repeating values on data trees and branching counter systems.- Automata, Logic and Formal Languages.- Degree of sequentiality of weighted automata.- Emptiness under isolation and the value problem for hierarchical probabilistic automata.- Partial Derivatives for Context-Free Languages.- Dynamic Complexity of the Dyck Reachability.- Proof Theory.- Cyclic Arithmetic is Equivalent to Peano Arithmetic.- Martin-Lof's Inductive Definitions are Not Equivalent to Cyclic Proofs.- Probability.- On the relationship between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context.- Computing continuous time Markov chains as transformers of unbounded observation functions.- Pointless Learning.- On Higher-Order Probabilistic Subrecursion. - Concurrency.- A Truly Concurrent Game Model of the Asynchronous ᴨ-Calculus.- Local Model Checking in a Logic for True Concurrency.- The Paths to Choreography Extraction.- On the Undecidability of Asynchronous Session Subtyping.- Lambda Calculus and Constructive Proof.- A Lambda-Free Higher-Order Recursive Path Order.- Automated Constructivization of Proofs.- Semantics and Category Theory.- A Light Modality for Recursion.- Unifying Guarded and Unguarded Iteration.- Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type.- On the Semantics of Intensionality.