Beynon, Meurig and Buckle, John Francis (1985) Computation equivalence and replaceability in finite algebras. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)

Preview

PDF WRAP_cs-rr-072.pdf - Other - Requires a PDF viewer. Download (4Mb) | Preview

Request Changes to record.

Abstract

In this paper, we consider computational equivalence and replaceabiiity in various classes of finite algebras, and show in particular how to characterize these relations for finite lattices and semi-lattices. Results include generalizations of theorems previously proved for distributive lattices, and a description of computational equivalence and replaceablity in the multiplicative semigroup of residues modulo aI integer. Non-replaceability of monotone boolean functions is shown to be NP-complete.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Algebra, Boolean, Finite groups
Series Name:	Department of Computer Science Research Report
Publisher:	University of Warwick. Department of Computer Science
Place of Publication:	Coventry, UK
Official Date:	August 1985
Dates:	Date Event August 1985 Completion
Number:	Number 72
DOI:	CS-RR-072
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Related URLs:	Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads