Abstract
Among a set of n coins of two weights (good and bad), and using a balance, we wish to determine the number of bad coins using as few measurements as possible. There is a known adaptive decision tree that answers this question in O((log(n))2) measurements, and a slight modification of this decision tree determines the parity of the number of bad coins in O(logn). In this article, we prove an Ω(\sqrt{n}) lower bound on the depth of any oblivious decision tree which solves either the counting or the parity problem. Our lower bound can also be applied to any function of high average sensitivity, which includes most random functions and most random symmetric functions. With a slight generalization of this result, we derive lower bounds for the size of threshold circuits for a wide class of Boolean functions.
We demonstrate an exponential gap between the nonadaptive and adaptive coin-weighing complexities of the counting and parity problems. We prove a tight Θ(logn) bound on the adaptive coin-weighing complexity of the parity problem.
- Aigner, M. and Li, A. 1997. Searching for counterfeit coins. Graph. Combin. 13, 1, 9--20.Google Scholar
Cross Ref
- Alon, N. and Kozlov, D. N. 1997. Coins with arbitrary weights. J. Algor. 25, 1, 162--176. Google Scholar
Digital Library
- Alon, N. and Vu, V. H. 1997. Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs. J. Comb. Theory, Ser. A 79, 1, 133--160. Google Scholar
Digital Library
- Alon, N., Kozlov, D. N. and Vu, V. H. 1996. The geometry of coin-weighing problems. In Proceedings of the Symposium on Foundations of Computer Science (FOCS). 524--532. Google Scholar
Digital Library
- Babai, L. Algorithms. Homework problem, University of Chicago. http://www.classes.cs.uchicago.edu/archive/2005/winter/27200-1/assignments/03.pdf.Google Scholar
- Born, A., Hurkens, C. A. J., and Woeginger, G. J. 2003. How to detect a counterfeit coin: Adaptive versus non-adaptive solutions. Inf. Process. Lett. 86, 3, 137--141. Google Scholar
Digital Library
- Dyson, F. J. 1946. The problem of the pennies. The Math. Gaz. 30, 29, 231--234.Google Scholar
Cross Ref
- Guy, R. K. and Nowakowski, R. J. 1995. Coin-weighing problems. Amer. Math. Month. 102, 2, 164--167.Google Scholar
Cross Ref
- Hu, X-D., Chen, P. D., and Hwang, F. K. 1994. A new competitive algorithm for the counterfeit coin problem. Inf. Process. Lett. 51, 4, 213--218. Google Scholar
Digital Library
- Kozlov, D. N. and Vu, V. H. 1997. Coins and cones. J. Comb. Theory, Ser. A 78, 1, 1--14. Google Scholar
Digital Library
- Pyber, L. 1986. How to find many counterfeit coins? Graph. Combin. 2, 1, 173--177.Google Scholar
Digital Library
Index Terms
Lower Bounds for Coin-Weighing Problems
Recommendations
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithmsMany NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle, every decision problem expressible in monadic second order logic is fixed ...
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds
We give a general transformation that turns polynomial-size Frege proofs into subexponential-size AC0-Frege proofs. This indicates that proving truly exponential lower bounds for AC0-Frege is hard, as it is a long-standing open problem to prove ...
Exponential lower bounds for AC0-Frege imply superpolynomial frege lower bounds
ICALP'11: Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part IWe give a general transformation which turns polynomialsize Frege proofs to subexponential-size AC0-Frege proofs. This indicates that proving exponential lower bounds for AC0-Frege is hard, since it is a longstanding open problem to prove super-...






Comments