ESTTCS2006：软件技术与理论计算机学基础/会议录LNCS-4337: FSTTCS 2006

首页 ┆ 咨询 ┆ 科普 ┆ 论坛 ┆ 博客

我的账户 ┆

购物车内容 ┆ 去收银台

动漫周边 ┆ 数码 ┆ 最新商品 ┆ 出版社 ┆ 丛书 ┆ 作者 ┆ 最近出版书籍 ┆ 在线阅读 ┆ RSS

商品搜索

高级搜索

热门搜索词：不负如来不负卿早期教育与天才经典成语

您现在的位置：书城 > 图书 > 电脑图书 > 软件技术 > 软件项目管理 > 商品信息

ESTTCS2006：软件技术与理论计算机学基础/会议录LNCS-4337: FSTTCS 2006

定价: ￥632.80元 金桥价: ￥601.16元 节省: ￥31.64元

出版/发行时间: 2006-12-01

出版社: 湖南文艺出版社

作者: S. Arun-Kumar

ISBN: 9783540499947

版次: 1

内容简介

This book constitutes the refereed proceedings of the 26th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2006, held in Kolkata, India, in December 2006.
The 34 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 155 submissions. A broad variety of current topics from the theory of computing are addressed, ranging from software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics, complexity theory, and automata theory to theoretical computer science in general.

Invited Papers
　Shared-Variable Concurrency: A Proposal
　Hennessy-Plotkin-Brookes Revisited
　Approximation Algorithms for 2-Stage Stochastic Optimization　Problems
　The Number of Crossing Free Configurations on Finite Point Sets　in the Plane
Contributed Papers - Track A
　Normal and Feature Approximations from Noisy Point Clouds
　Coresets for Discrete Integration and Clustering
　Self-assemblying Classes of Shapes with a Minimum Number of Tiles,　and in Optimal Time
　One-Input-Face MPCVP Is Hard for L, But in LogDCFL
　Hardness of Approximation Results for the Problem of Finding　the Stopping Distance in Tanner Graphs
　Multi-stack Boundary Labeling Problems
　Computing a Center-Transversal Line
　On Obtaining Pseudorandomness from Error-Correcting Codes
　Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
　Zero Error List-Decoding Capacity of the q/(q - 1) Channel
　Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
　Solving Connected Dominating Set Faster Than 2~.
　Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species
　Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
　Some Results on Average-Case Hardness Within the Polynomial Hierarchy
　Unbiased Rounding of Rational Matrices
Contributed Papers - Track B
　Rational Behaviour and Strategy Construction in Infinite Multiplayer Games.
　The Anatomy of Innocence Revisited
　Testing Probabilistic Equivalence Through ReinforceInent Learning
　On Decidability of LTL Model Checking for Process Rewrite Systems
　Monitoring of Real-Time Properties
……
Author Index

这件商品于 2007-12-14 添加.