Solution to the realizability problem for irredundant Boolean branch- networks

DOI10.1016/0016-0032(59)90521-6zbMath0156.17605OpenAlexW1994184182MaRDI QIDQ2526681

Lars Löfgren

Publication date: 1959

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(59)90521-6

zbMATH Keywords

numerical analysis

Related Items (2)

On Okada's method for realizing cut-set matrices ⋮ Nonseparating Cocircuits in Binary Matroids

Cites Work

• Unnamed Item
• Unnamed Item
• A Way to Simplify Truth Functions
• Automata of high complexity and methods of increasing their reliability by redundancy
• Graphs and Vector Spaces
• The Problem of Simplifying Truth Functions

This page was built for publication: Solution to the realizability problem for irredundant Boolean branch- networks