Searching for "On The Learnability Of Disjunctive Normal Form Formulas." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Generalized Graph Colorability and Compressibility of Boolean Formulae
by Richard Nock, Pascal Jappy, Jean Sallantin — 1998 — In Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC
… widely studied class of Boolean Formulae : Disjunctive Normal Forms (DNF). An Occam's razor…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB