Almost complete sets. (Q1426448): Difference between revisions
From MaRDI portal
Latest revision as of 15:54, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Almost complete sets. |
scientific article |
Statements
Almost complete sets. (English)
0 references
14 March 2004
0 references
The authors consider the class \({\mathbf E}\) of sets being computable in (linear) exponential time. They define the concept of almost completeness for the class \({\mathbf E}\) under some given reducibility if the class of languages in \({\mathbf E}\) that do not reduce to this set has measure 0 in \({\mathbf E}\), in the sense of Lutz's resource-bounded measure theory, based on polynomial-time computable martingales. The main result states that there are sets in \({\mathbf E}\) being almost complete but not complete under polynomial-time many-one reductions.
0 references
resource-bounded measure
0 references
weak completeness
0 references
almost completeness
0 references
resource-bounded reducibilities
0 references
many-one reductions
0 references
length-increasing one-one reductions
0 references
1-tt-reductions
0 references
0 references