Nock, Jappy, and Sallantin. Generalized graph colorability and compressibility of boolean formulae. In ISAAC: 9th International Symposium on Algorithms and Computation (formerly SIGAL International Symposium on Algorithms), 1998. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Learning DNF Formulas: A Survey - Hellerstein (Correct)
No context found.
Nock, Jappy, and Sallantin. Generalized graph colorability and compressibility of boolean formulae. In ISAAC: 9th International Symposium on Algorithms and Computation (formerly SIGAL International Symposium on Algorithms), 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC