scientific article
From MaRDI portal
Publication:3929672
zbMath0473.94018MaRDI QIDQ3929672
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Theory of software (68N99)
Related Items
Connectionistic models of Boolean category representation, Disjunctive models of Boolean category learning, Minimal coverings for incompletely specified sequential machines, Polynomial-time algorithms for regular set-covering and threshold synthesis, Longest cycles in threshold graphs, On the capabilities of multilayer perceptrons, Minimal covering problem and PLA minimization, An algorithm for assigning multiplexer inputs, Controllability decomposition of dynamic-algebraic Boolean control networks, A new lower bound on the expected size of irredundant forms for Boolean functions, Prominent classes of the most general subsumptive solutions of Boolean equations, Using variable-entered karnaugh maps to solve boolean equations, Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees, Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA), Useless prime implicants of incompletely specified multiple-output switching functions, Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT, Two-Level Multiple-Output Logic Minimization Using A Single Function, Parallel multipliers with NOR gates based on G-minimum adders, A purely map procedure for two-level multiple-output logic minimization
