The problem of deciding whether a given coin appears in the greedy solution for a target amount is P-complete under log-space reductions.
The complexity of tensor circuit evaluation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Greedy Coin Change Problem
The problem of deciding whether a given coin appears in the greedy solution for a target amount is P-complete under log-space reductions.