Comparing and analyzing the computational complexity of FCA algorithms

Fedor Strok, Alexey Neznanov. Comparing and analyzing the computational complexity of FCA algorithms. In Paula Kotzé, Alta van der Merwe, Aurona Gerber, editors, Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists, SAICSIT Conf. 2010, Bela Bela, South Africa, October 11-13, 2010. ACM International Conference Proceeding Series, pages 417-420, ACM, 2010. [doi]

@inproceedings{StrokN10,
  title = {Comparing and analyzing the computational complexity of FCA algorithms},
  author = {Fedor Strok and Alexey Neznanov},
  year = {2010},
  doi = {10.1145/1899503.1899557},
  url = {http://doi.acm.org/10.1145/1899503.1899557},
  researchr = {https://researchr.org/publication/StrokN10},
  cites = {0},
  citedby = {0},
  pages = {417-420},
  booktitle = {Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists, SAICSIT Conf. 2010, Bela Bela, South Africa, October 11-13, 2010},
  editor = {Paula Kotzé and Alta van der Merwe and Aurona Gerber},
  series = {ACM International Conference Proceeding Series},
  publisher = {ACM},
  isbn = {978-1-60558-950-3},
}