Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum

DOI10.1007/978-3-642-22685-4_7zbMath1353.68295OpenAlexW2114430034MaRDI QIDQ3087940

Dongxiao Yu, Francis C. M. Lau, Yuexuan Wang, Qiang-Sheng Hua

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Exact enumeration problems, generating functions (05A15) Nonnumerical algorithms (68W05)

Related Items (2)

Parameterized counting matching and packing: a family of hard problems that admit FPTRAS ⋮ On Counting Parameterized Matching and Packing

This page was built for publication: Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum