Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,519,489 papers from all fields of science
Search
Sign In
Create Free Account
Change-making problem
Known as:
Change making problem
The change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Broader (1)
Combinatorial optimization
Dynamic programming
Fast Fourier transform
Greedy algorithm
Knapsack problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
On the Change-Making Problem
Timothy M. Chan
,
Qizheng He
SIAM Symposium on Simplicity in Algorithms
2020
Corpus ID: 209513109
Given a set of n non-negative integers representing a coin system, the change-making problem seeks the fewest number of coins…
Expand
2018
2018
Transition Matrix
D. Gleich
Encyclopedia of Social Network Analysis and…
2018
Corpus ID: 16488130
1 Ways to Describe a Stochastic Process We will use the biased coin example to illustrate three ways with which we can describe a…
Expand
2016
2016
A Graphical Representation of NP-Completeness with One-Dimensional Cellular Automata
Giorgos Bougioukas
2016
Corpus ID: 67778581
This paper proves that for every instance of the (NP-complete or NP-hard, depending on the version) change-making problem (CMP…
Expand
Review
2013
Review
2013
Greedy Algorithm: Huffman Algorithm
Annu Malik
,
Neeraj Goyat
2013
Corpus ID: 123887297
This paper presents a survey on Greedy Algorithm. This discussion is centered on overview of huffman code, huffman algorithm and…
Expand
2005
2005
5 an Np-completeness Result
G. Frandsen
,
Kim S. Larsen
,
Peter Bro Miltersen
,
Erik Meineche
2005
Corpus ID: 48507288
The change making problem is the problem of representing a given value with the fewest coins possible We investigate the problem…
Expand
2004
2004
Technology mapping and packing for coarse-grained, anti-fuse based FPGAs
C. Kang
,
A. Iranli
,
Massoud Pedram
Asia and South Pacific Design Automation…
2004
Corpus ID: 2688415
We present a new synthesis flow for antifuse based FPGAs with multiple-output logic cells. The flow consists of two steps…
Expand