Cargando…
Discrete Algorithms and Complexity : Proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan.
Discrete Algorithms and Complexity.
| Clasificación: | Libro Electrónico |
|---|---|
| Autores Corporativos: | , , |
| Otros Autores: | , , , |
| Formato: | Electrónico Congresos, conferencias eBook |
| Idioma: | Inglés |
| Publicado: |
Orlando :
Academic Press,
1987.
|
| Colección: | Perspectives in computing (Boston, Mass.) ;
vol. 15. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn898422244 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 141220s1987 flu o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d N$T |d OCLCQ |d OCLCF |d YDXCP |d DEBSZ |d OCLCO |d OCL |d OCLCO |d OCLCQ |d OCLCO |d OCLCQ |d MERUC |d OCLCQ |d UKAHL |d OCLCQ |d OCLCO |d K6U |d OCLCA |d OCLCQ |d OCLCO |d OCLCL | ||
| 066 | |c (S | ||
| 020 | |a 9781483274003 |q (electronic bk.) | ||
| 020 | |a 1483274004 |q (electronic bk.) | ||
| 029 | 1 | |a CHNEW |b 000889671 | |
| 029 | 1 | |a CHVBK |b 374483906 | |
| 029 | 1 | |a DEBBG |b BV043615462 | |
| 029 | 1 | |a DEBSZ |b 431866228 | |
| 029 | 1 | |a AU@ |b 000056055819 | |
| 035 | |a (OCoLC)898422244 | ||
| 050 | 4 | |a QA76.6 | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511 |2 23 |
| 049 | |a UAMI | ||
| 245 | 0 | 0 | |a Discrete Algorithms and Complexity : |b Proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan. |
| 260 | |a Orlando : |b Academic Press, |c 1987. | ||
| 300 | |a 1 online resource (497 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Perspectives in computing ; |v vol. 15 | |
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |6 880-01 |a Front Cover; Discrete Algorithms and Complexity; Copyright Page; Table of Contents; Contributors; Foreword; Chapter 1. An Upper Bound on the Expected Cost of an Optimal Assignment; Introduction; A Regularity Condition; The Transportation Problem and its Dual; Acknowledgement; References; Chapter 2. The Principal Partition of Vertex-Weighted Graphs and Its Applications; 1. Introduction; 2. The Principal Partition of Vertex-Weighted Graphs and Solution Algorithms For Problem 2; 3. Flow Assignment In The Graph Defined For Problem 4: Part 1. | |
| 505 | 8 | |a 4. Flow Assignment In The Graph Defined For Problem 4: Part25. Applications; 6. Concluding Remarks; References; Chapter 3. Generalized Colorings; 0. Introduction; 1. Parameters; 2. Algorithmic Issues; 3. Obstructions; 4. The Homomorphism Order; REFERENCES; Chapter 4. Voronoi Diagram for Points in a Simple Polygon; 1. Introduction; 2. Sketch of the algorithm; 3. Constructing the weighted Voronoi diagram; References; Chapter 5. Computing the Geodesic Center of aSimple Polygon; 1. Introduction; 2. Uniqueness of Geodesic Center; 3. Geodesic Diameter of a Simple Polygon. | |
| 505 | 8 | |a 4. Farthest-Point Voronoi DiagraReferences; Chapter 6. On deleting vertices to make a graph of positive genus planar; 1. Introduction; 2. Background in topologioal graph theory and order arithmetic; 3. The main result; 4. Conclusion; References; Chapter 7. Algorithms for Routing around a Rectangle; 1. Introduction; 2. Edge-disjoint paths; 3. Routing; 4. Minimum area routing; References; Chapter 8. A Remark on the Complexity of the Knapsack Problem; 1. Introduction; 2. The Basic Algorithm and a Restricted Modification; 3. The Three List Problem and its Relation to the Knapsack Problem. | |
| 504 | |a ReferencesChapter 9. Fast, Rigorous Factorisation and Diecrete Logarltha Algoritluas; 1. Introduction; 2. A riaoroua version of the elliptic curve factorinamethod; 3. Factoring with random squares; 4. Discrete logarithes In GF (pages); 5. DISCRETE LOGARITHMS OVERGF (2n); REFERENCES; Chapter 10. Redundant Coding for Local Computability; 1. Introduction; 2. Coding and Local Computability; 3. Addition on Residue Class; 4. High-speed Parallel Computation of Operations on Finite Abelian Group; 5. Applications; 6. Conclusion; Acknowledgement; References. | ||
| 500 | |a Electronic Prototyping. | ||
| 520 | |a Discrete Algorithms and Complexity. | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Computer programming |v Congresses. | |
| 650 | 0 | |a Computer algorithms |v Congresses. | |
| 650 | 0 | |a Computational complexity |v Congresses. | |
| 650 | 6 | |a Programmation (Informatique) |v Congrès. | |
| 650 | 6 | |a Algorithmes |v Congrès. | |
| 650 | 6 | |a Complexité de calcul (Informatique) |v Congrès. | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Computer programming |2 fast | |
| 655 | 7 | |a Conference papers and proceedings |2 fast | |
| 700 | 1 | |a Johnson, David S., |d 1945- |1 https://id.oclc.org/worldcat/entity/E39PBJth6Cgbcqh9wXvkd36Myd | |
| 700 | 1 | |a Nishizeki, T. |q (Takao), |d 1947-2022. |1 https://id.oclc.org/worldcat/entity/E39PBJtX9pHrfbHWvm9F8dPYT3 | |
| 700 | 1 | |a Nozaki, Akihiro, |d 1936- |1 https://id.oclc.org/worldcat/entity/E39PBJh4xFFPxqKxXbq3mkHBfq | |
| 700 | 1 | |a Wilf, Herbert S., |d 1931-2012. |1 https://id.oclc.org/worldcat/entity/E39PBJt8mF6bGw9FbYy4gBGWDq | |
| 710 | 2 | |a Nihon Gakujutsu Shinkōkai. | |
| 710 | 2 | |a National Science Foundation (U.S.) | |
| 711 | 2 | |a Japan-US Joint Seminar on Discrete Algorithms and Complexity Theory |d (1986 : |c Kyoto, Japan) | |
| 758 | |i has work: |a Discrete Algorithms and Complexity (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFCx6thdWRrBJ3XBmQv8md |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Johnson, David S. |t Discrete Algorithms and Complexity : Proceedings of the Japan-US Joint Seminar, June 4 - 6, 1986, Kyoto, Japan. |d Burlington : Elsevier Science, ©2014 |z 9780123868701 |
| 830 | 0 | |a Perspectives in computing (Boston, Mass.) ; |v vol. 15. | |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1888448 |z Texto completo |
| 880 | 8 | |6 505-01/(S |a Chapter 11. SOME PROPERTIES OF THE PARALLEL BUBBLING ΑΝD PARALLEL SORTS ON A MESH-OONNEOTEOD ROOESSOR ARRAY1. Introduction; 2. Properties of the parallel bubbling; 3. Sorting on a mesh-connected processor array; 4· Lower Bounds on Computing Times; 5. Concluding remarks; References; Chapter 12. Game Solving Procedure HIs Unsurpassed; 1. Introduction; 2. Game Trees and Search Procedures; 3. Outline of the Proof; 4. Proof for Case A; 5. Proof for Case Β; 6. Some Properties of H; 7. Proof for Case C; References; Chapter 13. Algorithmic Problems in Modeling and Electronic Prototyping; Introduction. | |
| 936 | |a BATCHLOAD | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH25552504 | ||
| 938 | |a EBL - Ebook Library |b EBLB |n EBL1888448 | ||
| 938 | |a EBSCOhost |b EBSC |n 927566 | ||
| 938 | |a YBP Library Services |b YANK |n 12207605 | ||
| 994 | |a 92 |b IZTAP | ||