✦ LIBER ✦

Linear and combinatorial sharing problems

✍ Scribed by Uwe Zimmermann

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 891 KB
Volume: 15
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90022-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear problems in combinatorial number

Linear problems in combinatorial number theory

✍ J. Komlós; M. Sulyok; E. Szemerédi 📂 Article 📅 1975 🏛 Akadmiai Kiad 🌐 English ⚖ 407 KB

On approximate algorithms for combinator

On approximate algorithms for combinatorial linear maximization problems

✍ C. Croitoru 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 232 KB

Parallel Output-Sensitive Algorithms for

Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems

✍ John H. Reif 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 160 KB

This paper gives output-sensitive parallel algorithms whose performance depends on the output size and are significantly more efficient tan previous algorithms for problems with sufficiently small output size. Inputs are n\_n matrices over a fixed ground field. Let P(n) and M(n) be the PRAM processo

Concept of linearity and convexity in a

Concept of linearity and convexity in a discrete space. Combinatorial linear problems. II

✍ M. F. Kaspshitskaya; I. V. Sergienko 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 504 KB

Concept of linearity and convexity in a

Concept of linearity and convexity in a discrete space. Combinatorial linear problems. I

✍ M. F. Kaspshitskaya; I. V. Sergienko 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 721 KB

There Exists a Linear Problem with Infin

There Exists a Linear Problem with Infinite Combinatory Complexity

✍ G.W. Wasilkowski; H. Woźniakowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 430 KB