Learning Boolean Read-Once Formulas over Generalized Bases (1995)
| Citations: | 10 - 3 self |
BibTeX
@MISC{Bshouty95learningboolean,
author = {Nader H. Bshouty and Thomas R. Hancock and Lisa Hellerstein},
title = {Learning Boolean Read-Once Formulas over Generalized Bases},
year = {1995}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A read-once formula is one in which each variable appears on at most a single input. Angluin, Hellerstein, and Karpinski give a polynomial time algorithm that uses membership and equivalence queries to identify exactly read-once boolean formulas over the basis fAND;OR;NOTg [AHK93]. The goal of this work is to consider natural generalizations of these gates, in order to develop exact identification algorithms for more powerful classes of formulas. We show that read-once formulas over a basis of arbitrary boolean functions of constant fan-in k or less (i.e. any f : f0; 1g 1ck ! f0; 1g) are exactly identifiable in polynomial time using membership and equivalence queries. We show that read-once formulas over the basis of arbitrary symmetric boolean functions are also exactly identifiable in polynomial time in this model. Given standard cryptographic assumptions, there is no polynomial time identification algorithm for read-twice formulas over either of these bases using membership and e...
