On learning width two branching programs
From MaRDI portal
Publication:293246
DOI10.1016/S0020-0190(97)00204-4zbMath1339.68129MaRDI QIDQ293246
Nader H. Bshouty, Christino Tamon, David K. Wilson
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097002044?np=y
68Q32: Computational learning theory
Related Items
Testing computability by width-two OBDDs, On PAC learning algorithms for rich Boolean function classes, Efficient learning algorithms yield circuit lower bounds, An efficient query learning algorithm for ordered binary decision diagrams, Lower Bounds for Testing Computability by Small Width OBDDs
Cites Work