A polynomial time algorithm for Sylvester waves when entries are bounded
From MaRDI portal
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Software, source code, etc. for problems pertaining to combinatorics (05-04) Computational methods for problems pertaining to combinatorics (05-08)
This page was built for publication: A polynomial time algorithm for Sylvester waves when entries are bounded
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939595)