On the Complexity of Computing Generators of Closed Sets

Miki Hermann, Baris Sertkaya. On the Complexity of Computing Generators of Closed Sets. In Raoul Medina, Sergei A. Obiedkov, editors, Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings. Volume 4933 of Lecture Notes in Computer Science, pages 158-168, Springer, 2008. [doi]

@inproceedings{HermannS08,
  title = {On the Complexity of Computing Generators of Closed Sets},
  author = {Miki Hermann and Baris Sertkaya},
  year = {2008},
  doi = {10.1007/978-3-540-78137-0_12},
  url = {http://dx.doi.org/10.1007/978-3-540-78137-0_12},
  researchr = {https://researchr.org/publication/HermannS08},
  cites = {0},
  citedby = {0},
  pages = {158-168},
  booktitle = {Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings},
  editor = {Raoul Medina and Sergei A. Obiedkov},
  volume = {4933},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-78136-3},
}