Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa (Q287075): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficient and fast algorithm to generate minimal Reed-Muller exclusive-OR expansions with mixed polarity for completely and incompletely specified functions and its computer implementation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Easily Testable Realizations ror Logic Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimization of Reed–Muller Canonic Expansion / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimisation of fixed-polarity AND/XOR canonical networks / rank | |||
Normal rank | |||
Revision as of 01:07, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa |
scientific article |
Statements
Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa (English)
0 references
26 May 2016
0 references
analysis of algorithms
0 references
combinatorial problems
0 references
design of algorithms
0 references
