✦ LIBER ✦

On the complexity of computations under varying sets of primitives

✍ Scribed by David P. Dobkin; Richard J. Lipton

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 351 KB
Volume: 18
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90054-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Complexity of Analytic Sets

✍ Karel Hrbacek 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 463 KB 👁 1 views

On the density of primitive sets

✍ R. Ahlswede; L. Khachatrian; A. Sárközy 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Classical results by Behrend, Erdös, Pillai, Szemerédi, the authors, and others are improved and extended to other concepts of densities in two directions, based on smooth and multiplicative weightings.

On the complexity of online computations

On the complexity of online computations of real functions

✍ Klaus Weihrauch 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 813 KB

A reasonable computational complexity theory for real functions is obtained by using the modified infinite binary representation with digits 0, 1, and -1 for the real numbers and Turing machines which transform with one-way output modified binary input sequences into modified binary output sequences

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

Some results on the complexity of famili

Some results on the complexity of families of sets

✍ Daniel Grieser 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 872 KB

Grieser, D., Some results on the complexity of families of sets, Discrete Mathematics 88 (1991) 179-192. Let 'Y be a property of graphs on a fixed n-element vertex set V. The complexity c(P) is the minimal number of edges whose existence in a previously unknown graph H has to be tested such that it

On the Counting Function of Primitive Se

On the Counting Function of Primitive Sets of Integers

✍ Rudolf Ahlswede; Levon H Khachatrian; András Sárközy 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 131 KB