FINDING TYPE SETS IS NP-HARD (Q4024641): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0218196791000304 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056825649 / rank | |||
Normal rank | |||
Latest revision as of 10:04, 30 July 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
