An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (Q1327236): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 03:57, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function |
scientific article |
Statements
An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (English)
0 references
18 December 1994
0 references
dualizing a positive Boolean function
0 references
Hop-Skip-and-Jump algorithm
0 references
set- covering
0 references
