A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. Curticapean, R., Lindzey, N., & Nederlof, J. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1080–1099, 2018.

Paper doi bibtex

@inproceedings{DBLP:conf/soda/CurticapeanLN18,
  author    = {Radu Curticapean and
               Nathan Lindzey and
               Jesper Nederlof},
  title     = {A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank},
  booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages     = {1080--1099},
  year      = {2018},
  crossref  = {DBLP:conf/soda/2018},
  url       = {https://doi.org/10.1137/1.9781611975031.70},
  doi       = {10.1137/1.9781611975031.70},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/CurticapeanLN18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0

{"_id":"PL2tH5hAoPG4YWLje","bibbaseid":"curticapean-lindzey-nederlof-atightlowerboundforcountinghamiltoniancyclesviamatrixrank-2018","downloads":0,"creationDate":"2018-12-05T09:14:34.476Z","title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank","author_short":["Curticapean, R.","Lindzey, N.","Nederlof, J."],"year":2018,"bibtype":"inproceedings","biburl":"https://dblp.org/pid/33/7187.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Radu"],"propositions":[],"lastnames":["Curticapean"],"suffixes":[]},{"firstnames":["Nathan"],"propositions":[],"lastnames":["Lindzey"],"suffixes":[]},{"firstnames":["Jesper"],"propositions":[],"lastnames":["Nederlof"],"suffixes":[]}],"title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank","booktitle":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018","pages":"1080–1099","year":"2018","crossref":"DBLP:conf/soda/2018","url":"https://doi.org/10.1137/1.9781611975031.70","doi":"10.1137/1.9781611975031.70","timestamp":"Fri, 02 Nov 2018 00:00:00 +0100","biburl":"https://dblp.org/rec/bib/conf/soda/CurticapeanLN18","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/soda/CurticapeanLN18,\n author = {Radu Curticapean and\n Nathan Lindzey and\n Jesper Nederlof},\n title = {A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank},\n booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete\n Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},\n pages = {1080--1099},\n year = {2018},\n crossref = {DBLP:conf/soda/2018},\n url = {https://doi.org/10.1137/1.9781611975031.70},\n doi = {10.1137/1.9781611975031.70},\n timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/bib/conf/soda/CurticapeanLN18},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Curticapean, R.","Lindzey, N.","Nederlof, J."],"key":"DBLP:conf/soda/CurticapeanLN18","id":"DBLP:conf/soda/CurticapeanLN18","bibbaseid":"curticapean-lindzey-nederlof-atightlowerboundforcountinghamiltoniancyclesviamatrixrank-2018","role":"author","urls":{"Paper":"https://doi.org/10.1137/1.9781611975031.70"},"downloads":0},"search_terms":["tight","lower","bound","counting","hamiltonian","cycles","via","matrix","rank","curticapean","lindzey","nederlof"],"keywords":[],"authorIDs":[],"dataSources":["qoaa8S6oo6iCH58av"]}