Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv

DOI オープンアクセス

説明

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.

詳細情報 詳細情報について

問題の指摘

ページトップへ