𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Robust stability: The computational complexity point of view

✍ Scribed by R Tempo; V Cerone

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
585 KB
Volume
8
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Class Number Relations from a Computatio
Class Number Relations from a Computational Point of View
✍ Wieb Bosma; Bart DE Smit πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 353 KB

Brauer and Kuroda showed in the fifties how in a Galois extension of number fields, relations between permutation characters of subgroups provide relations between invariants, such as the discriminant, class number and regulator, of the corresponding intermediate fields. In this paper we investigate

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.