Algebraic formulation of circuit design problems

DOI10.1007/BF01069635MaRDI QIDQ3328470zbMATH OpenOpenAlexFDO

Authors A. I. Petrenko, A. Ya. Tetel'Baum, B. L. Shramchenko

Publication date 1981

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01069635

zbMATH Keywords

Boolean equationsBoolean functionsCircuit design problemslogical propositionspseudo-Boolean functions

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites work

• scientific article; zbMATH DE number 3501238 (Why is no real title available?)
• Integer programming formulation of combinatorial optimization problems
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

Cited in

(9)

• A constraint satisfaction approach to a circuit design problem
• An algebraic diagnostic method for symmetric function circuitry
• scientific article; zbMATH DE number 3898775 (Why is no real title available?)
• scientific article; zbMATH DE number 4045251 (Why is no real title available?)
• New algebraic methods for modelling large‐scale integrated circuits
• scientific article; zbMATH DE number 177245 (Why is no real title available?)
• Design-Oriented Analysis of Circuits With Equality Constraints
• scientific article; zbMATH DE number 3894507 (Why is no real title available?)
• The rational approximation of circuit design

This page was built for publication: Algebraic formulation of circuit design problems

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