Name
Abstract | ||
|---|---|---|
In this paper we consider four different definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and reasonable families of function classes, three of these extensions are mathematically equivalent. However we also demonstrate that such an equivalence does not hold for all classes. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-44929-9_20 | IFIP TCS |
Keywords | Field | DocType |
boolean function,function class,partially defined boolean functions,missing bits,reasonable family,consistent extensions,different definition,missing bit | Boolean function,Discrete mathematics,Computer science,Equivalence (measure theory),Implicant | Conference |
ISBN | Citations | PageRank |
3-540-67823-9 | 2 | 0.40 |
References | Authors | |
13 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Endre Boros | 1 | 1779 | 155.63 |
| Toshihide Ibaraki | 2 | 2593 | 385.64 |
| Kazuhisa Makino | 3 | 1088 | 102.74 |