Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa (Q287075): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00068-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991499304 / rank | |||
Normal rank | |||
Latest revision as of 11:16, 30 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
