FINDING TYPE SETS IS NP-HARD
type: Item
instance of: scholarly article
title: FINDING TYPE SETS IS NP-HARD
zbMATH Open document ID: 0757.08005
DOI: 10.1142/S0218196791000304
author: David Hobby
published in: International Journal of Algebra and Computation
publication date: 1993-02-08T00:00:00Z
Mathematics Subject Classification ID: 08B99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 118359
zbMATH Keywords: type set
zbMATH Keywords: variety generated by a finite algebra
zbMATH Keywords: \(P\)-Space-hard
zbMATH Keywords: \(P\)- Space-complete
zbMATH Keywords: composition of a set of unary functions
MaRDI profile type: Publication
full work available at URL: s0218196791000304
OpenAlex ID: W2056825649
description: scientific article