On Learning Exclusive-Or of Terms


Consider the class of read-O(log n) Exclusive-Or of terms formulae (ENF). That is, formulae which are Exclusive-Or of, not necessarily monotone, terms where each variable appears in the formula at most O(log n) times. We show that this class is learnable in polynomial time from membership and equivalence queries with an output hypothesis that is a… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics