arXiv (OAI Expanded)open access
A polynomial time algorithm for almost bounded denumerant
combinatorics, primary 05a17, secondary 11p81, 05--08
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗Related documents
Record · ID 610944
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.