网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 其它 > 其它 > 商品详情

随机化与近似技术/会议录 Randomization and approximation

分享到:
随机化与近似技术/会议录 Randomization and approximation

最 低 价:¥388.70

定 价:¥452.00

作 者:JoseD.P. Rolim 著

出 版 社:湖南文艺出版社

出版时间:2002-12-1

I S B N:9783540441472

商品详情

编辑推荐

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.)

内容简介

This book constitutes the refereed proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2002, held in Cambridge, MA, USA in September 2002.The 21 revised full papers presented were carefully reviewed and selected from 48 submissions. Among the topics addressed are coding, geometric computations, graph colorings, random hypergraphs, graph computations, lattice computations, proof systems, probabilistic algorithms, derandomization, constraint satisfaction, and web graphs analysis.

作者简介

目录

Counting Distinct Elements in a Data Stream
On Testing Convexity and Submodularity
w-Regular Languages Are Testable with a Constant Number of Queries
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes
Counting and Sampling H-Colourings
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs
On the 2-Colorability of Random Hypergraphs
Percolation on Finite Cayley Graphs
Computing Graph Properties by Randomized Subcube Partitions
Bisection of Random Cubic Graphs
Small k-Dominating Sets of Regular Graphs
Finding Sparse Induced Subgraphs of Semirandom Graphs
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View
Quantum Walks on the Hypercube
Randomness-Optimal Characterization of Two NP Proof Systems
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good
Is Constraint Satisfaction Over Two Variables Always Easy?
Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications
On the Eigenvalue Power Law
Classifying Special Interest Groups in Web Graphs
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

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