Pages that link to "Item:Q2571269"
From MaRDI portal
The following pages link to Faster algorithms for Frobenius numbers (Q2571269):
Displaying 16 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation (Q431520) (← links)
- An enumeration algorithm for all integers nonrepresentable by some positive integers (Q477659) (← links)
- Expected Frobenius numbers (Q618307) (← links)
- The asymptotic distribution of Frobenius numbers (Q977169) (← links)
- LLL-reduction for integer knapsacks (Q1928499) (← links)
- Computational aspects of ordered integer partitions with bounds (Q2006947) (← links)
- On the number of integer points in translated and expanded polyhedra (Q2227240) (← links)
- Diameters of random circulant graphs (Q2439833) (← links)
- (Q3305812) (← links)
- Using Double-Loop digraphs for solving Frobenius' Problems (Q3439408) (← links)
- Some contributions to the Frobenius' Problem (Q3439566) (← links)
- The Frobenius Problem and Its Generalizations (Q3533000) (← links)
- (Q4987392) (← links)
- The Dilating Method for Cayley digraphs on finite Abelian groups (Q5000300) (← links)
- Gaps in nonsymmetric numerical semigroups. (Q5962245) (← links)
