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..
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.
Mathematical Reviews
None
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.
Approximation Algorithms for Combinatorial Optimization
This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002. The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and other fields.
