Corpus ID: 17755265

Optimal Algorithms for the Coin Weighing Problem with a Spring Scale

@inproceedings{Bshouty2009OptimalAF,
  title={Optimal Algorithms for the Coin Weighing Problem with a Spring Scale},
  author={Nader H. Bshouty},
  booktitle={COLT},
  year={2009}
}
  • N. Bshouty
  • Published in COLT 2009
  • Mathematics, Computer Science
Suppose we are given n coins out of a collection of coins of two distinct weights w0 and w1, true and counterfeit coins, respectively, where d of them are counterfeit coins. [...] Key Method This algorithm is based on a new optimal adaptive algorithm for reconstructing bounded weight vectors in polynomial time. This solves the general problem of learning any linear function with bounded integer coefficient in polynomial time with optimal number of substitution queries. To the best of our knowledge all the…Expand
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity
TLDR
A deterministic polynomial time adaptive algorithm is given for identifying the counterfeit coins and their weights using O (m log n/log m + m log log m) weighings, assuming that the weight of the counterfeit coin are greater than the Weight of the authentic coin. Expand
Toward a deterministic polynomial time algorithm with optimal additive query complexity
TLDR
A deterministic polynomial time adaptive algorithm is given for identifying the counterfeit coins and their weights using O(mlognlogm+mloglogm) weighings, assuming that the weight of the counterfeiting coins are greater than theWeight of the authentic coins. Expand
Algorithms for the Coin Weighing Problems with the Presence of Noise
TLDR
A non-adaptive polynomial time algorithm that does O(n/ log n) weighings and detect the counterfeit coins even if n of the answers of the weighings received are incorrect or missing for any constant c < 1. Expand
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness
TLDR
While for randomized algorithms queries are sufficient, the deterministic non-adaptive counterpart still requires Θ(klog k +1(n/k) queries, in case k ≤ n/28; therefore, finding any subset of defectives is not easier than finding all of them by a non- Adaptive deterministic algorithm. Expand
A Simple and Efficient Strategy for the Coin Weighing Problem with a Spring Scale
TLDR
This paper considers a generalized version of the coin weighing problem with a spring scale that lies at the intersection of group testing and compressed sensing problems and proposes and analyzes a simple and effective adaptive weighing strategy. Expand
Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights
TLDR
The rst polynomial time algorithms with optimal query complexity for the general class of graphs with n vertices and at most m edges in which the weights of edges are arbitrary real numbers are constructed. Expand
The Deterministic and Randomized Query Complexity of a Simple Guessing Game
TLDR
By using randomization Paul can find the secret code with an expected number of O(n log log n) queries, which is optimal by matching it with a lower bound of the same asymptotic magnitude. Expand
On the Coin Weighing Problem with the Presence of Noise
  • N. Bshouty
  • Mathematics, Computer Science
  • APPROX-RANDOM
  • 2012
TLDR
This paper considers the following coin weighing problem: given n coins for which some of them are counterfeit with the same weight, how to detect the counterfeit coins a with minimal number of weighings. Expand
The Query Complexity of Finding a Hidden Permutation
TLDR
This work proves matching upper and lower bounds for the deterministic and randomized query complexity of Θ(n logn) and Θ (n loglogn), respectively. Expand
ApSimon's Mint Problem with Three or More Weighings
ApSimon considered the problem of deciding by a process of two weighings on which of a known number of mints emit either coins of a known genuine weight or emit coins of a different secondary butExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 56 REFERENCES
ON TWO PROBLEMS OF INFORMATION THEORY bY PAUL ERDGS and ALFRJ~D RgNYI
The first problem1 which will be discussed in this paper can be formulated as follows: Suppose we are given n coins, which look quite alike, but of which some are false. (For instance suppose thatExpand
Determining a set from the cardinalities of its intersections with other sets
E « ieSj determine the et uniquely. We are interested in finding, as a function of n, the least integer fin) such t h a t there exists a determining collection containing fin) subsets of N. This canExpand
Optimal query complexity bounds for finding graphs
TLDR
It is proved that there exists a non-adaptive algorithm to find the edges of G using O(m log n / log m) queries of both types provided that m ≥ nε for any constant ε > 0 and it is shown that the same bound holds for all range of m. Expand
On a Combinatorial Problem in Number Theory
1. Introduction One of the problems mentioned injl] (on p. 187) concerns the estimation of the magnitude of the largest number g(N) such that, from every sequence of N distinct natural numbers, oneExpand
Identification of Partial Disjunction, Parity, and Threshold Functions
TLDR
This paper studies the query complexity of attribute-efficient learning for three function classes that are, respectively, obtained from disjunction, parity, and threshold functions and obtains almost optimal upper and lower bound on the number of queries. Expand
Search problems on graphs
  • M. Aigner
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1986
TLDR
In this paper, the following natural generalization to graphs is studied and remarks are made on optimal graphs which achieve the information-theoretic lower bound and on a previously studied binary variant. Expand
On the Power of Additive Combinatorial Search Model
TLDR
An optimal upper bound is proved for the class of k-degenerate graphs and it unifies many known results for coin-weighing problems. Expand
Optimal Reconstruction of Graphs Under the Additive Model
TLDR
The main result concerns the reconstruction of bounded degree graphs, i.e. graphs with the degree of all vertices bounded by a constant d, that can be reconstructed in O(dn) non-adaptive queries, that matches the information-theoretic lower bound. Expand
An Application of Codes to Attribute-Efficient Learning
TLDR
This work designs asymptotically optimal query strategies for the class of parity functions which contain at most k essential variables and presents a strategy which is optimal up to additive constants. Expand
The optimal procedures for quantitative group testing
  • Fred H. Hao
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1990
TLDR
It is shown that the golden section method is not a good approximation for T(n) as n is large, and several inequalities about T( n) are obtained, and the convergence of { T (n) ln n } is proved. Expand
...
1
2
3
4
5
...