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

Almost Combinatorial Selector Sets

โœ Scribed by A. N. Degtev


Book ID
111566669
Publisher
SP MAIK Nauka/Interperiodica
Year
2000
Tongue
English
Weight
75 KB
Volume
68
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Weakly combinatorial selector sets
โœ A. N. Dyogtev; D. I. Ivanov ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Springer US ๐ŸŒ English โš– 304 KB
Implicatively selector sets
โœ A. N. Dyogtev ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Springer US ๐ŸŒ English โš– 265 KB
Cantor set selectors
โœ V. Gutev; S. Nedev; J. Pelant; V. Valov ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 234 KB
Almost Combinatorial Skolem Functions
โœ Erik Ellentuck ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Association for Symbolic Logic ๐ŸŒ English โš– 896 KB
Almost semirecursive sets
โœ A. N. Degtev ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 256 KB
Almost complete sets
โœ Klaus Ambos-Spies; Wolfgang Merkle; Jan Reimann; Sebastiaan A. Terwijn ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 353 KB

We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2 lin . Here a set in a complexity class C is almost complete for C under some given reducibility if the class of the problems