๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Complexity of Analytic Sets

โœ Scribed by Karel Hrbacek

Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
463 KB
Volume
24
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Dual Sets of Analytic Functions
On Dual Sets of Analytic Functions
โœ V. Kasten; S. T. Ruscheweyh ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 296 KB ๐Ÿ‘ 1 views
On Some Complexity Characteristics of Im
On Some Complexity Characteristics of Immune Sets
โœ Valeriy K. Bulitko ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 363 KB ๐Ÿ‘ 1 views

## Abstract We suggest some new ways to effectivize the definitions of several classes of simple sets. On this basis, new completeness criterions for simple sets are obtained. In particular, we give descriptions of the class of complete maximal sets.

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

Complexity of Recognizing Equal Unions i
Complexity of Recognizing Equal Unions in Families of Sets
โœ David P. Jacobs; Robert E. Jamison ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 87 KB

A family of sets has the equal union property if there exist two nonempty disjoint subfamilies having equal unions and has the full equal union property if, in addition, all sets are included. Both recognition problems are NP-complete even when restricted to families for which the cardinality of eve