✦ LIBER ✦

On the complexity of four polyhedral set containment problems

✍ Scribed by Robert M. Freund; James B. Orlin

Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 309 KB
Volume: 33
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01582241

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of polyhedral separabi

On the complexity of polyhedral separability

✍ Nimrod Megiddo 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 745 KB

The parallel complexity of coarsest set

The parallel complexity of coarsest set partition problems

✍ Sang Cho; Dung T. Huynh 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 497 KB

On the complexity of approximatingk-set

On the complexity of approximatingk-set packing

✍ Elad Hazan; Shmuel Safra; Oded Schwartz 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 213 KB

On sets of integers containing no four e

On sets of integers containing no four elements in arithmetic progression

✍ E. Szemerédi 📂 Article 📅 1969 🏛 Akadmiai Kiad 🌐 English ⚖ 614 KB

On the complexity of tree embedding prob

On the complexity of tree embedding problems

✍ Shai Simonson; I.Hal Sudborough 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 534 KB

On the average complexity of multivariat

On the average complexity of multivariate problems

✍ A Papageorgiou; G.W Wasilkowski 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 904 KB

We study the average complexity of linear problems, on a separable Banach space equipped with an orthogonally invariant measure CL. The error and the cost of the algorithms are defined on the average. We exhibit an information operator which is optimal among any linear information operators. We appl