Complexity bounds on program realizations of Boolean functions specified in various forms
type: Item
instance of: scholarly article
title: Complexity bounds on program realizations of Boolean functions specified in various forms
zbMATH Open document ID: 0641.94031
author: L. Ya. Lapkin
published in: Automation and Remote Control
publication date: 1987-01-01T00:00:00Z
review text: We examine the complexity bounds on binary, k-ary, and matrix programs which represent Boolean functions specified in various forms.
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4045653
zbMATH Keywords: binary programs
zbMATH Keywords: complexity bounds
zbMATH Keywords: matrix programs
zbMATH Keywords: Boolean functions
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 4045653