Name
Abstract | ||
|---|---|---|
In this paper we consider four possible definitions for extending a partially defined Boolean function in which the input contains some missing bits. We show somewhat surprisingly that, for many general and frequently used families of function classes, three of these notions of an extension are mathematically equivalent, though such an equivalence does not hold universally, as demonstrated by several examples. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0890-5401(02)00012-3 | Inf. Comput. |
Keywords | Field | DocType |
extensions,boolean function,partially defined boolean functions,function class,logical analysis of data,missing bits,boolean functions,missing bit,possible definition | Boolean function,Discrete mathematics,Logical analysis of data,Logic analyzer,Equivalence (measure theory),Combinatorial analysis,Mathematics | Journal |
Volume | Issue | ISSN |
180 | 1 | Information and Computation |
Citations | PageRank | References |
2 | 0.52 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Endre Boros | 1 | 1779 | 155.63 |
| Toshihide Ibaraki | 2 | 2593 | 385.64 |
| Kazuhisa Makino | 3 | 1088 | 102.74 |