Average Complexity of Matrix Reduction for Clique Filtrations

Barbara Giunti, Guillaume Houry, Michael Kerber. Average Complexity of Matrix Reduction for Clique Filtrations. In Marc Moreno Maza, Lihong Zhi, editors, ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022. pages 187-196, ACM, 2022. [doi]

@inproceedings{GiuntiHK22,
  title = {Average Complexity of Matrix Reduction for Clique Filtrations},
  author = {Barbara Giunti and Guillaume Houry and Michael Kerber},
  year = {2022},
  doi = {10.1145/3476446.3535474},
  url = {https://doi.org/10.1145/3476446.3535474},
  researchr = {https://researchr.org/publication/GiuntiHK22},
  cites = {0},
  citedby = {0},
  pages = {187-196},
  booktitle = {ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022},
  editor = {Marc Moreno Maza and Lihong Zhi},
  publisher = {ACM},
  isbn = {978-1-4503-8688-3},
}