网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 计算机与网络 > 计算机/网络 > 商品详情

Mathematical Foundations of Computer Science 2006计算机科学的数学基础 2006: MFCS 2006/会议录

分享到:
Mathematical Foundations of Computer Science 2006计算机科学的数学基础 2006: MFCS 2006/会议录

最 低 价:¥884.80

定 价:¥983.10

作 者:RastislavKralovic,PawelUrzyczyn 著

出 版 社:湖北辞书出版社

出版时间:

I S B N:3540377913

商品详情

编辑推荐

内容简介

This book constitutes the refereed proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006, held in Stará Lesná, Slovakia in August/September 2006.
The 62 revised full papers presented together with the full papers or absts of 7 invited talks were carefully reviewed and selected from 174 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithms and data structures, to complexity, automata, semantics, logic, formal specifications, models of computation, concurrency theory, computational geometry, parallel and distributed computing, networks, bioinformatics, quantum computing, cryptography, knowledge-based systems, and artificial intelligence.

作者简介

目录


Invited Talks
A Core Calculus for Scala Type Checking
Tree Exploration with an Oracle
Distributed Data Structures: A Survey on Informative Labeling Schemes
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions
The Structure of Tractable Constraint Satisfaction Problems
On the Representation of Kleene Algebras with Tests
From Three Ideas in TCS to Three Applications in Bioinformatics
Contributed Papers
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
A Unified Construction of the Glushkov, Follow, and Antimirov Automata
Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
A Polynomial Time Nilpotence Test for Galois Groups and Related Results
The Multiparty Communication Bounds and New Problems
Crochemore Factorization of Sturmian and Other Infinite Words
Equations on Partial Words
Concrete Multiplicative Complexity of Symmetric Functions
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities
The Kleene Equality for Graphs
On the Repetition Threshold for Large Alphabets
hnproved Parameterized Upper Bounds for Vertex Cover
On Comparing Sums of Square Roots of Small Integers
A Combinatorial Approach to Collapsing Words
Optimal Linear Arrangement of Interval Graphs
The Lempel-Ziv Complexity of Fixed Points of Morphisms
Partially Commutative Inverse Monoids
Learning Bayesian Networks Does Not Have to Be NP-Hard
……
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...