Complexity of short generating functions
Combinatorics
2017-10-13 v4 Computational Complexity
Discrete Mathematics
Logic in Computer Science
Logic
Abstract
We give complexity analysis of the class of short generating functions (GF). Assuming , we show that this class is not closed under taking many intersections, unions or projections of GFs, in the sense that these operations can increase the bitlength of coefficients of GFs by a super-polynomial factor. We also prove that truncated theta functions are hard in this class.
Cite
@article{arxiv.1702.08660,
title = {Complexity of short generating functions},
author = {Danny Nguyen and Igor Pak},
journal= {arXiv preprint arXiv:1702.08660},
year = {2017}
}