Mathematical Foundations of Computer Science 1974, A. Blikle

Автор: 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.

Автор: 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.

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

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

Описание: Table of Contents - Volume II.- Algorithms, Complexity and Games.- On r-Simple k-Path.- Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs.- Zero Knowledge and Circuit Minimization.- A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity.- n)-Space and Polynomial-time Algorithm for Planar Directed Graph Reachability.- Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set.- Network-Based Dissolution.- On Unification of QBF Resolution-Based Calculi.- Minimum planar multi-sink cuts with connectivity priors.- The Price of Envy-Freeness in Machine Scheduling.- On the Complexity of Some Ordering Problems.- The Relationship Between Multiplicative Complexity and Nonlinearity.- Find Dual Connectedness of Edge-Bicolored Graphs and Beyond.- Combinatorial Voter Control in Elections.- An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas.- On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields.- Hitting forbidden subgraphs in graphs of bounded treewidth.- Probabilistic Analysis of Power Assignments.- Existence of Secure Equilibrium in Multi-Player Games with Perfect Information.- An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group.- A Note on the Minimum Distance of Quantum LDPC Codes.- Minimum Bisection is NP-hard on Unit Disk Graphs.- Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty.- Streaming Kernelization.- A Reconfigurations Analogue of Brooks' Theorem.- Intersection Graphs of L-Shapes and Segments in the Plane.- Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes.- Editing to a Connected Graph of Given Degrees.- Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.- On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity.- New Results for Non-Preemptive Speed Scaling.- Lower bounds for splittings by linear combinations.- On the Complexity of List Ranking in the Parallel External Memory Model.- Knocking Out Pk-free Graphs.- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis.- Affine consistency and the complexity of semilinear constraints.- Small complexity classes for computable analysis.- Two Results about Quantum Messages.- Parameterized Approximations via d-Skew-Symmetric Multicut.- On the Clique Editing Problem.- On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic.- Computational Complexity of Covering Three-Vertex Multigraphs.- Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs.- On Coloring Resilient Graphs.- Document Retrieval with One Wildcard.- An Hn=2 Upper Bound on the Price of Stability of Undirected Network Design Games.- Traveling Salesman Problems in Temporal Graphs.- Inferring Strings from Lyndon factorization.- Betweenness Centrality - Incremental and Faster.- Deterministic Parameterized Algorithms for the Graph Motif Problem.- The Two Queries Assumption and Arthur-Merlin Classes.- Flexible Bandwidth Assignment with Application to Optical Networks.- Approximation Algorithms For Bounded Color Matchings via Convex Decompositions.

Автор: 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.

Автор: Jiri Sgall; Ales Pultr; Petr Kolman
Название: Mathematical Foundations of Computer Science 2001
ISBN: 3540424962 ISBN-13(EAN): 9783540424963
Издательство: Springer
Рейтинг:
Цена: 16769.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Автор: Krzystof Diks; Wojciech Rytter
Название: Mathematical Foundations of Computer Science 2002
ISBN: 3540440402 ISBN-13(EAN): 9783540440406
Издательство: Springer
Рейтинг:
Цена: 16769.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, held in Warsaw, Poland in August 2002. This book addresses the aspects of theoretical computer science, ranging from discrete mathematics, algorithms, and complexity to programming theory, and mathematical logic.

Автор: Krishnendu Chatterjee; Jir? Sgall
Название: Mathematical Foundations of Computer Science 2013
ISBN: 3642403123 ISBN-13(EAN): 9783642403125
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

Alternation Trading Proofs and Their Limitations.- Bin Packing Games with Selfish Items.- A Constructive Proof of the Topological Kruskal Theorem.- Prior-Free Auctions of Digital Goods.- Clustering on k-Edge-Colored Graphs.- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally.- Rewriting Guarded Negation Queries.- Parity Games and Propositional Proofs.- Bringing Order to Special Cases of Klee's Measure Problem.- Learning Reductions to Sparse Sets.- Probabilistic Automata with Isolated Cut-Points.- On Stochastic Games with Multiple Objectives.- Paradigms for Parameterized Enumeration.- Noninterference with Local Policies.- Ordering Metro Lines by Block Crossings.- Meta-kernelization with Structural Parameters.- Polynomial Threshold Functions and Boolean Threshold Circuits.- Detecting Regularities on Grammar-Compressed Strings.- An Unusual Temporal Logic.

Автор: Rastislav Kr?lovic; Damian Niwinski
Название: Mathematical Foundations of Computer Science 2009
ISBN: 3642038158 ISBN-13(EAN): 9783642038150
Издательство: Springer
Рейтинг:
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 34th International Symposium MFCS 2009 Novy Smokovec High Tatras Slovakia August 2428 2009 Proceedi. .

Автор: Jiri Wiedermann; Petr Hajek
Название: Mathematical Foundations of Computer Science 1995
ISBN: 3540602461 ISBN-13(EAN): 9783540602460
Издательство: Springer
Рейтинг:
Цена: 14673.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This text presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MCFS `95, held in Prague in 1995. The papers are organized in sections on: structural complexity; algorithms; complexity theory; and graphs in models of computation among others.

Автор: 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.

Автор: P. Dembinski
Название: Mathematical Foundations of Computer Science 1980
ISBN: 354010027X ISBN-13(EAN): 9783540100270
Издательство: Springer
Рейтинг:
Цена: 6567.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.