A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions (Q4386450)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions |
scientific article; zbMATH DE number 1146502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions |
scientific article; zbMATH DE number 1146502 |
Statements
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions (English)
0 references
23 June 1998
0 references
maximum latency
0 references
0.9972813725471495
0 references
0.9151962995529176
0 references
0.8569959402084351
0 references
