On the computational complexity of algebra on lattices

We study the computational complexity of equivalence and minimization problems for expressions on many different lattices including each finite lattice and each distributive lattice. A general efficient expressibility condition $C$ on a lattice is presented such that 1. The equivalence problem is co...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 1987-02, Vol.16 (1), p.129-148
Hauptverfasser:	HUNT, H. B. III, ROSENKRANTZ, D. J, BLONIARZ, P. A
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!