%0 Conference Paper %1 conf/stacs/BorosGKM02 %A Boros, Endre %A Gurvich, Vladimir %A Khachiyan, Leonid %A Makino, Kazuhisa %B STACS %D 2002 %E Alt, Helmut %E Ferreira, Afonso %I Springer %K dblp %P 133-141 %T On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2002.html#BorosGKM02 %V 2285 %@ 3-540-43283-3

@inproceedings{conf/stacs/BorosGKM02, added-at = {2017-05-26T00:00:00.000+0200}, author = {Boros, Endre and Gurvich, Vladimir and Khachiyan, Leonid and Makino, Kazuhisa}, biburl = {https://www.bibsonomy.org/bibtex/2ce449ae98ee8a32919dda529dc746983/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2002}, editor = {Alt, Helmut and Ferreira, Afonso}, ee = {https://doi.org/10.1007/3-540-45841-7_10}, interhash = {860b1521d6766d7a67f509a75a83b007}, intrahash = {ce449ae98ee8a32919dda529dc746983}, isbn = {3-540-43283-3}, keywords = {dblp}, pages = {133-141}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T15:25:28.000+0200}, title = {On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2002.html#BorosGKM02}, volume = 2285, year = 2002 }