The Sketching Complexity of Graph and Hypergraph Counting

John Kallaugher, Michael Kapralov, Eric Price. The Sketching Complexity of Graph and Hypergraph Counting. In Mikkel Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018. pages 556-567, IEEE Computer Society, 2018. [doi]

@inproceedings{KallaugherKP18,
  title = {The Sketching Complexity of Graph and Hypergraph Counting},
  author = {John Kallaugher and Michael Kapralov and Eric Price},
  year = {2018},
  doi = {10.1109/FOCS.2018.00059},
  url = {https://doi.org/10.1109/FOCS.2018.00059},
  researchr = {https://researchr.org/publication/KallaugherKP18},
  cites = {0},
  citedby = {0},
  pages = {556-567},
  booktitle = {59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018},
  editor = {Mikkel Thorup},
  publisher = {IEEE Computer Society},
  isbn = {978-1-5386-4230-6},
}