✦ LIBER ✦

Computational complexity of PERT problems

✍ Scribed by Jane N. Hagstrom

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 415 KB
Volume: 18
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230180206

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the computational complexity of the m

On the computational complexity of the minimum-dummy-activities problem in a pert network

✍ Maciej M. Syslo 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 454 KB

The Computational Complexity of Some Pro

The Computational Complexity of Some Problems of Linear Algebra

✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=

Complexity of the minimum-dummy-activiti

Complexity of the minimum-dummy-activities problem in a pert network

✍ M. S. Krishnamoorthy; N. Deo 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

The Computational Complexity of Choice S

The Computational Complexity of Choice Sets

✍ Felix Brandt; Felix Fischer; Paul Harrenstein 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract Social choice rules are often evaluated and compared by inquiring whether they satisfy certain desirable criteria such as the __Condorcet criterion__, which states that an alternative should always be chosen when more than half of the voters prefer it over any other alternative. Many of

The Computational Complexity of Antimatr

The Computational Complexity of Antimatroid Properties

✍ Jamas Enright 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Oracle complexity for antimatroids is defined. Several antimatroid oracles are compared and their relative strengths are examined. Characterizations of several classes of antimatroids are given, and the complexity of recognising membership of these classes is examined.

The Computational Complexity of Densest

The Computational Complexity of Densest Region Detection

✍ Shai Ben-David; Nadav Eiron; Hans Ulrich Simon 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 296 KB

We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from unlabeled samples of this distribution. We introduce a formal learning model for this task that uses a hypothesis class as it ''anti-overfitting'' mechanism. The learning task in our mo