New Added

Computing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings

Like Score+365

Computing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings
Original Title Computing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings
Author COCOON 2001 (2001 : Guilin, China), Wang, Jie
Publication date

Topics Computer science, Combinatorial analysis
Publisher Berlin , New York : Springer
Collection folkscanomy_miscellaneous, folkscanomy, additional_collections
Language English
Book Type EBook
Material Type Book
File Type PDF
Downloadable Yes
Support Mobile, Desktop, Tablet
Scan Quality: Best No watermark
PDF Quality: Good
Availability Yes
Price 0.00
Submitted By
Sketch the Cow
Submit Date
Computing and Combinatorics: 7th Annual International Conference, COCOON 2001 Guilin, China, August 20–23, 2001 Proceedings
Author: Jie Wang
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42494-9
DOI: 10.1007/3-540-44679-6

Table of Contents:

  • Complete Problems for Valiant’s Class of qp-Computable Families of Polynomials
  • Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n
  • On Universally Polynomial Context-Free Languages
  • Separating Oblivious and Non-oblivious BPs
  • Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws
  • Algebraic Properties for P-Selectivity
  • Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM
  • Enhanced Sequence Reconstruction with DNA Microarray Application
  • Non-approximability of Weighted Multiple Sequence Alignment
  • A Greedy Algorithm for Optimal Recombination
  • Generating Well-Shaped d-dimensional Delaunay Meshes
  • Towards Compatible Triangulations
  • An Improved Upper Bound on the Size of Planar Convex-Hulls
  • On the Planar Two-Watchtower Problem
  • Efficient Generation of Triconnected Plane Triangulations
  • Packing Two Disks into a Polygonal Environment
  • Maximum Red/Blue Interval Matching with Application
  • Computing Farthest Neighbors on a Convex Polytope
  • Finding an Optimal Bridge between Two Polygons
  • How Good Is Sink Insertion?

Includes bibliographical references and index

We will be happy to hear your thoughts

Leave a reply

eBookmela
Logo
Register New Account
Reset Password
Compare items
  • Total (0)
Compare
0