The following pages link to (Q3929672):
Displaying 19 items.
- Prominent classes of the most general subsumptive solutions of Boolean equations (Q507645) (← links)
- A new lower bound on the expected size of irredundant forms for Boolean functions (Q673913) (← links)
- Connectionistic models of Boolean category representation (Q1081315) (← links)
- Disjunctive models of Boolean category learning (Q1087845) (← links)
- Minimal coverings for incompletely specified sequential machines (Q1088411) (← links)
- Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
- On the capabilities of multilayer perceptrons (Q1105387) (← links)
- Longest cycles in threshold graphs (Q1343260) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- Using variable-entered karnaugh maps to solve boolean equations (Q2752264) (← links)
- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT (Q2818016) (← links)
- A purely map procedure for two-level multiple-output logic minimization (Q3438797) (← links)
- An algorithm for assigning multiplexer inputs (Q3476267) (← links)
- Parallel multipliers with NOR gates based on G-minimum adders (Q3676064) (← links)
- Minimal covering problem and PLA minimization (Q3735634) (← links)
- Useless prime implicants of incompletely specified multiple-output switching functions (Q3887362) (← links)
- Two-Level Multiple-Output Logic Minimization Using A Single Function (Q4454322) (← links)
- Controllability decomposition of dynamic-algebraic Boolean control networks (Q5134314) (← links)
- Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA) (Q5443485) (← links)
