منابع مشابه
Jug measuring: Algorithms and complexity
We study the hardness of the optimal jug measuring problem. By proving tight lower and upper bounds on the minimum number of measuring steps required, we reduce an inapproximable NP-hard problem (i.e., the shortest GCD multiplier problem [G. Havas, J.-P. Seifert, The Complexity of the Extended GCD Problem, in: LNCS, vol. 1672, Springer, 1999]) to it. It follows that the optimal jug measuring pr...
متن کاملQuantifying and Measuring Morphological Complexity
It is a standard assumption in Linguistics that all human languages are equally (and enormously) complex; when looked at as a whole, no language can be called “simpler” than another. Certainly, languages can differ in the distribution of their complexity, so that one might employ a richer inflectional system, or entertain a more complicated gamut of syllable shapes than another, but it is gener...
متن کاملMeasuring and Optimizing Behavioral Complexity
Model complexity is key concern to any artificial learning system due its critical impact on generalization. However, EC research has only focused phenotype structural complexity for static problems. For sequential decision tasks, phenotypes that are very similar in structure, can produce radically different behaviors, and the trade-off between fitness and complexity in this context is not clea...
متن کاملJus Measuring: Algorithm and Complexity
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 μc(x) (i.e., min x=x·c ||x||1, where c ∈ N, x ∈ N, ||x||1 = ∑n i=1 |xi|) for estimating the minimum measuring steps is indeed a problem in P . Moreover, we prove that testing ...
متن کاملAlgorithms and complexity
material may be reproduced for any educational purpose, multiple copies may be made for classes, etc. Charges, if any, for reproduced copies must be just enough to recover reasonable costs of reproduction. Reproduction for commercial purposes is prohibited. This cover page must be included in all distributed copies. It may be taken at no charge by all interested persons. Comments and correction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.003