skip to main content
research-article

Lower Bounds for Coin-Weighing Problems

Published:01 March 2011Publication History
Skip Abstract Section

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.

References

  1. Aigner, M. and Li, A. 1997. Searching for counterfeit coins. Graph. Combin. 13, 1, 9--20.Google ScholarGoogle ScholarCross RefCross Ref
  2. Alon, N. and Kozlov, D. N. 1997. Coins with arbitrary weights. J. Algor. 25, 1, 162--176. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. Babai, L. Algorithms. Homework problem, University of Chicago. http://www.classes.cs.uchicago.edu/archive/2005/winter/27200-1/assignments/03.pdf.Google ScholarGoogle Scholar
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. Dyson, F. J. 1946. The problem of the pennies. The Math. Gaz. 30, 29, 231--234.Google ScholarGoogle ScholarCross RefCross Ref
  8. Guy, R. K. and Nowakowski, R. J. 1995. Coin-weighing problems. Amer. Math. Month. 102, 2, 164--167.Google ScholarGoogle ScholarCross RefCross Ref
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. Kozlov, D. N. and Vu, V. H. 1997. Coins and cones. J. Comb. Theory, Ser. A 78, 1, 1--14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Pyber, L. 1986. How to find many counterfeit coins? Graph. Combin. 2, 1, 173--177.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Lower Bounds for Coin-Weighing Problems

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Computation Theory
            ACM Transactions on Computation Theory  Volume 2, Issue 2
            March 2011
            57 pages
            ISSN:1942-3454
            EISSN:1942-3462
            DOI:10.1145/1944857
            Issue’s Table of Contents

            Copyright © 2011 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 March 2011
            • Accepted: 1 October 2010
            • Revised: 1 February 2010
            • Received: 1 April 2008
            Published in toct Volume 2, Issue 2

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!