𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Communication complexity of two decision problems

✍ Scribed by Anders Björner; Johan Karlander; Bernt Lindström

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
230 KB
Volume
39
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognition problems and communication c
Recognition problems and communication complexity
✍ Gábor Wiener 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 248 KB

A special case of combinatorial search, the recognition problem is examined in this article. (H; A; f) is a recognition problem if H is a set, A is a set system on H and f : H → {0; 1} is a function. Someone chooses an arbitrary x ∈ H and instead of determining x itself (which is the case in most of

The communication complexity of several
The communication complexity of several problems in matrix computation
✍ Jeff I Chu; Georg Schnitger 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 747 KB

The communication complexity of a function f measures the communication resources required for computingf. In the design of VLSI systems, where savings on the chip area and computation time are desired, this complexity dictates an area x time\* lower bound. We investigate the communication complexit

The complexity of two group scheduling p
The complexity of two group scheduling problems
✍ Jacek Blazewicz; Mikhail Y. Kovalyov 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 94 KB

The problems of scheduling groups of jobs under the group technology assumption are studied. The two remaining open questions posed in the literature a decade ago about the computational complexity of these problems (J. Oper. Res. Soc., 1992; 43:395 -406), are answered. The parallel machine problem

Complexity of two dual criteria scheduli
Complexity of two dual criteria scheduling problems
✍ Yumei Huo; J.Y.-T. Leung; Hairong Zhao 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 185 KB

In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. We show that both problems are binary NP-hard.

Complexity of Nonlinear Two-Point Bounda
Complexity of Nonlinear Two-Point Boundary-Value Problems
✍ Bolesław Kacewicz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 282 KB

We study upper and lower bounds on the worst-case e-complexity of nonlinear two-point boundary-value problems. We deal with general systems of equations with general nonlinear boundary conditions, as well as with second-order scalar problems. Two types of information are considered: standard informa