Complexity Of Short Generating Functions
Work
Year: 2018
Type: article
Abstract: We give complexity analysis for the class of short generating functions . Assuming #P $\not \subseteq$ FP/poly , we show that this class is not closed under taking many intersections, unions or projec... more
Source: Forum of Mathematics Sigma
Authors Danny Nguyen, Igor Pak
Institution University of California, Los Angeles
Cites: 34
Cited by: 6
Related to: 20
FWCI: 1.258
Citation percentile (by year/subfield): 58.53
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
APC paid (est): $674