Pages that link to "Item:Q995775"
From MaRDI portal
The following pages link to A fast and simple algorithm for the money changing problem (Q995775):
Displaying 15 items.
- Counting glycans revisited (Q464771) (← links)
- On approximate jumbled pattern matching in strings (Q692932) (← links)
- Hulls of cyclic and negacyclic codes over finite fields (Q2011495) (← links)
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864) (← links)
- (Q3305812) (← links)
- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs (Q3452560) (← links)
- A Variation on the Money-Changing Problem (Q4908531) (← links)
- (Q4987392) (← links)
- Enumerating Possible Molecular Formulae in Mass Spectrometry Using a Generating Function Based Method (Q5050709) (← links)
- (Q5150610) (← links)
- (Q5150634) (← links)
- Determination of Glycan Structure from Tandem Mass Spectra (Q5323072) (← links)
- Inferring Peptide Composition from Molecular Formulas (Q5323075) (← links)
- On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\) (Q6177402) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
