Query-monotonic Turing reductions (Q2383592)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5192264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Query-monotonic Turing reductions |
scientific article; zbMATH DE number 5192264 |
Statements
Query-monotonic Turing reductions (English)
0 references
19 September 2007
0 references
NP-completeness
0 references
query-decreasing Turing reduction
0 references
query-increasing Turing reduction
0 references
query-monotonic Turing reduction
0 references
query-nondecreasing Turing reduction
0 references
query-nonincreasing Turing reduction
0 references
tight paddable set
0 references
0 references
0 references
0.88057625
0 references
0.8527861
0 references
0.8527861
0 references
0.8523502
0 references
0.85105366
0 references
0.8477506
0 references
0.84562266
0 references
