Some results on selectivity and self-reducibility
β Scribed by Jie Wang
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 677 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We distinguish self-reducibility of a language L with the question of whether search reduces to decision for L. Results include: (i) If NE{E, then there exists a set L in NP&P such that search reduces to decision for L, search does not nonadaptively reduce to decision for L and L is not self-reducib
In this paper we survey recent results and problems of both theoretical and algorithmic character on the construction of snarks-non-trivial cubic graphs of class two, of cyclic edge-connectivity at least 4 and with girth β₯ 5. We next study the process, also considered by Cameron, Chetwynd, Watkins,
Following guidance from the Organizing Committee, the authors give a brief introduction to the theory of spaces which are resolvable in the sense introduced by Hewitt (1943). The new results presented here are these. (A) A countably compact regular Hausdorff space without isolated points is w-resol