Cantitate/Preț
Produs

Mathematical Foundations of Computer Science 2013

Editat de Krishnendu Chatterjee, Jirí Sgall
en Limba Engleză Paperback – 8 aug 2013
This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.
Citește tot Restrânge

Preț: 35125 lei

Preț vechi: 43906 lei
-20%

Puncte Express: 527

Carte tipărită la comandă

Livrare economică 08-22 iunie


Specificații

ISBN-13: 9783642403125
ISBN-10: 3642403123
Pagini: 868
Ilustrații: XVI, 854 p. 92 illus.
Dimensiuni: 155 x 235 x 47 mm
Greutate: 1.29 kg
Ediția:2013
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

Caracteristici

Fast conference proceedings State-of-the-art report Up to date results