P
Initializing...
Theorem 1.2: conjunctions of boolean literals are PAC learnable by the elimination algorithm with m ≥ (2n/ε)(ln 2n + ln(1/δ)) examples · Prove2Me