Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms
type: Item
instance of: scholarly article
title: Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms
zbMATH Open document ID: 0548.94044
author: G. I. Ivanov
published in: Automation and Remote Control
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3875162
zbMATH Keywords: partial substitutions
zbMATH Keywords: expansion of Boolean functions
zbMATH Keywords: time decomposition
zbMATH Keywords: generalized graph schemes of algorithms
zbMATH Keywords: microprocessor realization
MaRDI profile type: Publication
Recommended article: Q4246551
Recommended article: On Decomposition of Sub-definite Partial Boolean Functions
Recommended article: Q3752396
Recommended article: On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
Recommended article: Complexity of sequential implementation of partial Boolean functions
Recommended article: Q3783976
Recommended article: Q3115633
Recommended article: Methods for decomposition of Boolean functions: algorithms, quality indices, and applications
Recommended article: On the efficiency of subsumption algorithms
Recommended article: Linear-time computation of optimal subgraphs of decomposable graphs
description: scientific article; zbMATH DE number 3875162