计算与组合数学 Computing and combinatorics
点此进入淘宝搜索页搜索分類: 图书,自然科学,数学,代数 数论 组合理论,
作者： Oscar H. Ibarra著
出 版 社： 湖南文艺出版社
出版时间： 2002-12-1字数：版次： 1页数： 606印刷时间： 2002/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540439967包装： 平装编辑推荐
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 8th Annual International Computing and Combinatorics Conference, COCOON 2002, held in Singapore in August 2002.The 60 revised full papers presented together with three invited contributions were carefully reviewed and selected from 106 submissions. The papers are organized in topical sections on complexity theory, discrete algorithms, computational biology and learning theory, radio networks, automata and formal languages, Internet networks, computational geometry, combinatorial optimization, and quantum computing.
目录
Invited Lectures
The Assembly of the Human and Mouse Cenomes
Data Structures for One-Dimensional Packet ClassificationUsing Most-Specific-Rule Matching
DNA Complementarity and Paradigms of Computing
Complexity Theory I
On Higher Arthur-Merlin Classes
(2＋f(n))-SAT and Its Properties
On the Minimal Polynomial of a Matrix
Computable Real Functions of Bounded Variationand Semi-computable Real Numbers
Discrete Algorithms I
Improved Compact Routing Tables for Planar Networksvia Orderly Spanning Trees
Coloring Algorithms on Subcubic Graphs
Efficient Algorithms for the Hamiltonian Problemon Distance-Hereditary Graphs
Extending the Accommodating Function
Computational Biology and Learning Theory I
Inverse Parametric Sequence Alignment
The Full Steiner Tree Problem in Phylogeny
Inferring a Union of Halfspaces from Examples
Dictionary Look-Up within Small Edit Distance
Coding Theory and Cryptography
Polynomial Interpolation of the Elliptic Curveand XTR Discrete Logarithm
Co-orthogonal Codes
Efficient Power-Sum Systolic Architecturesfor Public-Key Cryptosystems in GF(2m)
A Combinatorial Approach to Anonymous Membership Broadcast
Parallel and Distributed Architectures
Solving Constraint Satisfaction Problems with DNA Computing
New Architecture and Algorithms for Degradable VLSI/WSI Arrays
Cluster: A Fast Tool to Identify Groups of Similar Programs
Broadcasting in Generalized de Bruijn Digraphs
Graph Theory
On the Connected Domination Number of Random Regular Graphs
On the Number of Minimum Cuts in a Graph
……
Radio Networks
Automata nad Formal Languages
Internet Networks
Computational Geometry I
Computational Biology and Learnign Theory II
Discrete Algorithms II
Computational Geometry II
Combinatorial Optimization
Complexity II
Quantum Computing
Author Index
