MARC 닫기
00413nam ac200169 k 4500
000003573079
20220101120000
ta
010731s1987 US 000 eng
▼a 211070
▼c 211070
▼l WM0003021570
▼a QA76.6
▼a QA76.6
▼b D577
▼a PERSPECTIVES IN COMPUTING/
▼d JOHNSON,DAVID S
▼a BOSTON:
▼b ACADEMIC,
▼c 1987.
▼a 483p.
▼a JOHNSON,DAVID S
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| 분류기호 : | QA76.6 |
| 서명/저자사항 : | PERSPECTIVES IN COMPUTING/ JOHNSON,DAVID S |
| 발행사항 : | BOSTON: ACADEMIC, 1987. |
| 형태사항 : | 483p. |
| 개인저자 : | JOHNSON,DAVID S |
| 언어 | 영어 |
WMO199922058
권 호 : 483
발행년 : 1987
서 명 : PERSPECTIVES IN COMPUTING
발행처 : JOHNSON,DAVID S
목차
1. AN UPPER BOUND ON THE EXPECTED COST OF AN OPTIMAL ASSIGNMENT
2. THE PRINCIPLAL PARTITION OF VERTEX WEIGHTED GRAPHS
3. AND ITS APPLICATIONS
4. GENERALIZED COLORINGS
5. VORONOI DIAGRAM FOR POINTS IN A SIMPLE POLYGON
6. COMPUTING THE GEODESIC CENTER OF A SIMPLE POLYGON
7. ON DELETING VERTICES TO MAKE A GRAPH OF POSITIVE GENUS PLANAR
8. ALGORITHMS FOR ROUTING AROUND A RECTANGLE
9. A REMARK ON THE COMPLEXITY OF THE KNAPSACK PROBLEM
10. FAST, RIGOROUS FACTORIZATION AND DISCRETE LOGARITHM ALGORITHMS
11. REDUNDANT CODING FOR LOCAL COMPUTABILITY
12. SOME PROPERTIES OF THE PARALLEL BUBBING AND PARALLEL SORTS
13. ON A MESH-CONNECTED PROCESSOR ARRAY
14. GAME SOLVING PROCEDURE H* IS UNSURPASSED
15. ALGORITHMIC PROBLEMS IN MODELING AND ELECTRONIC PROTOTYPING
16. COMPLEMENTARY APPROACHES TO CNF BOOLEAN EQAUTIONS
서평쓰기