A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs

2002
*
Information and Computation
*

Branching programs are considered as a nonuniform model of computation in complexity theory as well as a data structure for boolean functions in several applications. In many applications (e.g., verification), exact representations are required. For learning boolean functions f on the basis of classified examples, it is sufficient to produce the representation of a function g approximating f . This motivates the investigation of the size of the smallest branching program approximating f .

doi:10.1006/inco.2002.3174
fatcat:5w23ftty6vhvrpfnrwjnsyk6cu