Learning Boolean read-once formulas over generalized bases
From MaRDI portal
Publication:1894458
DOI10.1006/jcss.1995.1042zbMath0837.68087OpenAlexW2003523975MaRDI QIDQ1894458
Nader H. Bshouty, Lisa Hellerstein, Thomas R. Hancock
Publication date: 21 August 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bf4ef26c1a8bbfcecff078ea54afba80edaa04f1
Related Items
Exact learning from an honest teacher that answers membership queries, Sums of read-once formulas: how many summands are necessary?, Unnamed Item, On the relationship between diagnostic and checking tests of the read-once functions, Read-once polynomial identity testing, Learning read once functions using subcube parity queries, Sums of Read-Once Formulas: How Many Summands Suffice?, Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees, Locating Errors in Faulty Formulas, Characterizing Arithmetic Read-Once Formulae, Optimal ordered binary decision diagrams for read-once formulas, Read-Once Functions Revisited and the Readability Number of a Boolean Function
