Share on TelegramComputing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20 23, 2
User Rating: Be the first one!
Author: COCOON 2001 (2001 : Guilin, China), Wang, Jie
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Computer science, Combinatorial analysis
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540424946
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 322.09 MB
PDF Size: 5.34 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 412
Views: 462
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 44679 6 archive t...torrent
Last Modified: 2022-03-09 09:48:46
Download
Size: 16.70 KB
Description
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:
Includes bibliographical references and index
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
You May Also Like
We will be happy to hear your thoughts
