計(jì)算與組合數(shù)學(xué) Computing and combinatorics

內(nèi)容概要

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 Classification　Using Most-Specific-Rule Matching　DNA Complementarity and Paradigms of ComputingComplexity 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 Variation　and Semi-computable Real NumbersDiscrete Algorithms I　Improved Compact Routing Tables for Planar Networks　via Orderly Spanning Trees 　Coloring Algorithms on Subcubic Graphs　Efficient Algorithms for the Hamiltonian Problem　on Distance-Hereditary Graphs　Extending the Accommodating FunctionComputational 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 DistanceCoding Theory and Cryptography　Polynomial Interpolation of the Elliptic Curve　and XTR Discrete Logarithm　Co-orthogonal Codes　Efficient Power-Sum Systolic Architectures　for Public-Key Cryptosystems in GF(2m)　A Combinatorial Approach to Anonymous Membership BroadcastParallel 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 DigraphsGraph Theory                                      On the Connected Domination Number of Random Regular GraphsOn the Number of Minimum Cuts in a Graph……Radio NetworksAutomata nad Formal LanguagesInternet NetworksComputational Geometry IComputational Biology and Learnign Theory IIDiscrete Algorithms IIComputational Geometry IICombinatorial OptimizationComplexity IIQuantum ComputingAuthor Index

圖書封面

圖書標(biāo)簽Tags

無

評論、評分、閱讀與下載

---

    計(jì)算與組合數(shù)學(xué) Computing and combinatorics PDF格式下載

---