Enumeration Reducibility Using Bounded Information: Counting Minimal Covers (Q3789543)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration Reducibility Using Bounded Information: Counting Minimal Covers |
scientific article; zbMATH DE number 4053593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration Reducibility Using Bounded Information: Counting Minimal Covers |
scientific article; zbMATH DE number 4053593 |
Statements
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers (English)
0 references
1987
0 references
compactness
0 references
decision reducibility
0 references
enumeration reducibility
0 references
degree structures
0 references
minimal covers
0 references
restricted information degrees
0 references
e- reducibility
0 references
0.7836498618125916
0 references
0.7534619569778442
0 references
0.7518097758293152
0 references
