比较购物 » 图书 » 进口原版 » Fundamentals of Computation Theory 计算理论基础/会议录
同类商品推荐
作者:Natasha Wing 著
来自 3 家商城
¥22.80~29.11
作者:BEATRIX POTTER 著
来自 3 家商城
¥39.00~51.00
作者:Brian James 著
来自 3 家商城
¥22.80~29.11
作者:Katharine Holabird, Helen Craig 著
来自 3 家商城
¥22.80~29.11
作者:本社 编
来自 2 家商城
¥81.30~109.37
Fundamentals of Computation Theory 计算理论基础/会议录
Fundamentals of Computation Theory 计算理论基础/会议录
 
作者:Maciej Liskiewicz 著 出版社:北京燕山出版社
出版日期:2005-9-1 0:00:00 ISBN:9783540281931
价格区间:¥634.7 (共有 1 家商家报价)
      This book constitutes the refereed proceedings of the 15th International Symposium Fundamentals of Computation Theory, FCT 2
价格比较发现有价格未更新? 请联系我们
商家所在地商家报价商家信誉购买
当当网 北京市安定门外大街208号三利大厦四层 ¥634.70
内容介绍
      This book constitutes the refereed proceedings of the 15th International Symposium Fundamentals of Computation Theory, FCT 2005, held in Lübeck, Germany in August 2005.
  The 46 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 105 submissions. The papers are organized in topical sections on circuits, automata, complexity, approximability, computational and structural complexity, graphs and complexity, computational game theory, visual cryptography and computational geometry, query complexity, distributed systems, automata and formal languages, semantics, approximation algorithms, average case complexity, algorithms, graph algorithms, and pattern matching.Invited Talks
 The Complexity of Querying External Memory and Streaming Data
 The Smoothed Analysis of Algorithms
Path Coupling Using Stopping Times
Circuits
On the Incompressibility of Monotone DNFs
Bounds on the Power of Constant-Depth Quantum Circuits
Automata I
Biautomatic Semigroups
Deterministic Automata on Unranked Trees
Complexity I
Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals
Generic Densitv and Small Span Theorem
Approximability
Logspace Optimization Problems and Their Approximability Properties
A Faster and Simpler 2-Approximation Algorithm for Block Sorting
Computational and Structural Complexity
On the Power of Unambiguity in Alternating Machines
Translational Lemmas for Alternating TMs and PRAMs
Collapsing Recursive Oracles for Relativized Polynomial Hierarchies
Graphs and Complexity
Exact Algorithms for Graph Homomorphisms
Improved Algorithms and Complexity Results for Power Domination in Graphs
Clique-Width for Four-Vertex Forbidden Subgraphs
Computational Game Theory
On the Complexity of Uniformly Mixed Nash Equilibria and RelatedRegular Subgraph Problems
Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems
Visual Cryptography and Computational Geometry
Perfect Reconstruction of Black Pixels Revisited
Adaptive Zooming in Point Set Labeling
Query Complexity
Graph Algorithms
Approximation Algorithms
Average-Case Compexity
Algorithms
ComplexityⅡ
Graph Algorithms
AutomataⅡ
Pattern Matching
Author Index
网友评论共有 0 条网友评论 发表评论
该产品没有用户评论!
发表评论
您的昵称: 您目前为匿名发表,请 登录注册
评论内容:
验证码: