Robert H. Sloan, Balázs Szörényi, György Turán. On k-term DNF with largest number of prime implicants. Electronic Colloquium on Computational Complexity (ECCC), (023), 2005. [doi]
@article{ECCC-TR05-023, title = {On k-term DNF with largest number of prime implicants}, author = {Robert H. Sloan and Balázs Szörényi and György Turán}, year = {2005}, url = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-023/index.html}, researchr = {https://researchr.org/publication/ECCC-TR05-023}, cites = {0}, citedby = {0}, journal = {Electronic Colloquium on Computational Complexity (ECCC)}, number = {023}, }