scientific article; zbMATH DE number 3743175
From MaRDI portal
Publication:3929672
Cited in
(19)- 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
- On the capabilities of multilayer perceptrons
- Longest cycles in threshold graphs
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Using variable-entered karnaugh maps to solve boolean equations
- Heuristic NPN classification for large functions using AIGs and LEXSAT
- A purely map procedure for two-level multiple-output logic minimization
- An algorithm for assigning multiplexer inputs
- Parallel multipliers with NOR gates based on G-minimum adders
- Minimal covering problem and PLA minimization
- Useless prime implicants of incompletely specified multiple-output switching functions
- Two-Level Multiple-Output Logic Minimization Using A Single Function
- Prominent classes of the most general subsumptive solutions of Boolean equations
- Controllability decomposition of dynamic-algebraic Boolean control networks
- Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA)
- A new lower bound on the expected size of irredundant forms for Boolean functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3929672)
