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

Almost convex sets

โœ Scribed by L. P. Vlasov


Publisher
SP MAIK Nauka/Interperiodica
Year
1975
Tongue
English
Weight
551 KB
Volume
18
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Almost convex and Chebyshev sets
โœ L. P. Vlasov ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 200 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