On comparability of sets
β Scribed by Alexander Abian
- Publisher
- Springer
- Year
- 1963
- Tongue
- English
- Weight
- 79 KB
- Volume
- 149
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A set A is k(n) membership comparable if there is a polynomial-time computable function that, given k(n) instances of A of length at most n, excludes one of the 2 k(n) possibilities for the memberships of the given strings in A. We show that if SAT is O(log n) membership comparable, then the NP-hard
The problem of comparability of structures and functions defined on structures is considered foliowing the early work of Muirhead (confined to intsnl parametrization) and more modern genercdization of Karamata. The basis of such comparabilities is the set of inequalities which when satisfied permit