Complexity problems in enumerative combinatorics

2018/03/18 by Pak, Igor
#05A #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #History and Overview (math.HO) #Probability (math.PR)

paper · doi:10.48550/arxiv.1803.06636

Abstract

We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.

Related

• Algebraic and geometric methods in enumerative combinatorics
• A Complexity Theory for Hard Enumeration Problems
• Enumerative Combinatorics
• Enumeration of Enumeration Algorithms
• Enumeration Complexity: Incremental Time, Delay and Space