✦ LIBER ✦

The complexity of computing minimum separating polygons

✍ Scribed by Peter Eades; David Rappaport

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 277 KB
Volume: 14
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(93)90140-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of computing the Muirhead

The complexity of computing the Muirhead–Dalton distance

✍ Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 259 KB

Optimal matching of general polygons bas

Optimal matching of general polygons based on the minimum zone error

✍ Jose A. Ventura; Ling-Ying Nain; Wenhua Wan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 588 KB

Fast computation of the modality of poly

Fast computation of the modality of polygons

✍ Alok Aggarwal; Robert C Melville 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 744 KB

On computing the minimum distance of lin

On computing the minimum distance of linear codes

✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

The complexity of designing a network wi

The complexity of designing a network with minimum diameter

✍ J. Plesnik 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB

What is the complexity of a distributed

What is the complexity of a distributed computing system?

✍ Anand Ranganathan; Roy H. Campbell 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB