Jug Measuring: Algorithm and Complexity
碩士 === 國立交通大學 === 資訊工程系所 === 92 === We study the water jug problem and obtain new lower and upper bounds on the minimum number of measuring steps. These bounds are tight and significantly improve previous results. We prove that to compute the crucial number $\mu_{\mathbf{c}}(x)$ (i.e., $\min\limit...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/06712731681083419419 |