arXiv (OAI Expanded)open access
A note on the $Σ_2^P$-completeness of the Frobenius number
computational complexity, optimization and control, 68q17, f.1.3
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 797853
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.