FINDING TYPE SETS IS NP-HARD (Q4024641)
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: FINDING TYPE SETS IS NP-HARD |
scientific article; zbMATH DE number 118359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | FINDING TYPE SETS IS NP-HARD |
scientific article; zbMATH DE number 118359 |
Statements
FINDING TYPE SETS IS NP-HARD (English)
0 references
8 February 1993
0 references
type set
0 references
variety generated by a finite algebra
0 references
\(P\)-Space-hard
0 references
\(P\)- Space-complete
0 references
composition of a set of unary functions
0 references
0.8199737071990967
0 references
0.7741823196411133
0 references
0.7313035726547241
0 references
