✦ 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
DOI: 10.1023/a:1026652431306

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