Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms

zbMATH Open0548.94044MaRDI QIDQ800318

G. I. Ivanov

Publication date: 1983

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

expansion of Boolean functionsgeneralized graph schemes of algorithmsmicroprocessor realizationpartial substitutionstime decomposition

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Related Items (1)

Decompositions of graphs of functions and fast iterations of lookup tables

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Methods for decomposition of Boolean functions: algorithms, quality indices, and applications 👍 👎
• On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs 👍 👎
• Complexity of sequential implementation of partial Boolean functions 👍 👎
• On the efficiency of subsumption algorithms 👍 👎
• Linear-time computation of optimal subgraphs of decomposable graphs 👍 👎
• On Decomposition of Sub-definite Partial Boolean Functions 👍 👎

This page was built for publication: Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800318)