Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino. On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. In Helmut Alt, Afonso Ferreira, editors, STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings. Volume 2285 of Lecture Notes in Computer Science, pages 133-141, Springer, 2002. [doi]
@inproceedings{BorosGKM02,
title = {On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets},
author = {Endre Boros and Vladimir Gurvich and Leonid Khachiyan and Kazuhisa Makino},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2285/22850133.htm},
researchr = {https://researchr.org/publication/BorosGKM02},
cites = {0},
citedby = {0},
pages = {133-141},
booktitle = {STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
editor = {Helmut Alt and Afonso Ferreira},
volume = {2285},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43283-3},
}