FINDING TYPE SETS IS NP-HARD (Q4024641): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:20, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FINDING TYPE SETS IS NP-HARD |
scientific article |
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
