Complexity problems in enumerative combinatorics
Combinatorics
2018-04-03 v2 Computational Complexity
Discrete Mathematics
History and Overview
Probability
Abstract
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
Keywords
Cite
@article{arxiv.1803.06636,
title = {Complexity problems in enumerative combinatorics},
author = {Igor Pak},
journal= {arXiv preprint arXiv:1803.06636},
year = {2018}
}
Comments
31 pages; an expanded version of the ICM 2018 paper (Section 4 added, refs expanded)