Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Mathematical Foundations of Computer Science 1998
This book constitutes the refereed proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS'98, held in Brno, Czech Republic, in August 1998. The 71 revised full papers presented were carefully reviewed and selected from a total of 168 submissions. Also included are 11 full invited surveys by prominent leaders in the area. The papers are organized in topical sections on problem complexity; logic, semantics, and automata; rewriting; automata and transducers; typing; concurrency, semantics, and logic; circuit complexity; programming; structural complexity; formal languages; graphs; Turing complexity and logic; binary decision diagrams, etc..
Mathematical Reviews
None
Parallel Processing and Applied Mathematics
This book constitutes the thoroughly refereed post-proceedings of the 6th International Conference on Parallel Processing and Applied Mathematics, PPAM 2005. The book presents 135 papers organized in topical sections on parallel and distributed architectures, parallel and distributed non-numerical algorithms, performance analysis, prediction and optimization, grid programming, tools and environments for clusters and grids, applications of parallel/distributed/grid computing, evolutionary computing with applications, parallel data mining, parallel numerics, and mathematical and computing methods.
An Introduction to Game Theory
This text emphasizes the ideas behind modern game theory rather than their mathematical expression, but defines all concepts precisely. It covers strategic, extensive and coalitional games and includes the topics of repeated games, bargaining theory and evolutionary equilibrium.
Extremal Combinatorics
This is a concise, up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called the gems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science illustrates the inherent usefulness of these methods.
Topics in Graph Automorphisms and Reconstruction
An in-depth coverage of selected areas of graph theory focusing on symmetry properties of graphs, ideal for beginners and specialists.
Referativnyĭ zhurnal
None
