Related papers: Chameleon Coins
Consider the coupon collector problem where each box of a brand of cereal contains a coupon and there are n different types of coupons. Suppose that the probability of a box containing a coupon of a specific type is $1/n$ and that we keep…
The realization of devices which harness the laws of quantum mechanics represents an exciting challenge at the interface of modern technology and fundamental science. An exemplary paragon of the power of such quantum primitives is the…
A coin is just a two sided dice. Recently, Mochon proved that quantum weak coin flipping with an arbitrarily small bias is possible. However, the use of quantum resources to allow N remote distrustful parties to roll an N-sided dice has yet…
Recognizing the type of an ancient coin requires theoretical expertise and years of experience in the field of numismatics. Our goal in this work is automatizing this time consuming and demanding task by a visual classification framework.…
A necklace or bracelet is \textit{colorful} if no pair of adjacent beads are the same color. In addition, two necklaces are \textit{equivalent} if one results from the other by permuting its colors, and two bracelets are \textit{equivalent}…
A camel can carry $B$ bananas on its back. It can have $2$ bananas at a time in its stomach. For each mile the camel walks, the amount of bananas in its stomach decreases $1$. As soon as the amount of bananas in the camel's stomach is at…
Cryptocurrencies offer an alternative to traditional methods of electronic value exchange, promising anonymous, cash-like electronic transfers, but in practice they fall short for several key reasons. We consider the false choice between…
Chameleon and symmetron theories serve as archetypal models for how light scalar fields can couple to matter with gravitational strength or greater, yet evade the stringent constraints from classical tests of gravity on Earth and in the…
Hierarchical clustering remains a fundamental challenge in data mining, particularly when dealing with large-scale datasets where traditional approaches fail to scale effectively. Recent Chameleon-based algorithms - Chameleon2, M-Chameleon,…
The Sleeping Beauty Problem remains a paradoxical problem that penetrates multiple disciplines that include probability theory, self-locating belief, decision theory, cognitive science, the philosophy of mathematics and science. It asks the…
In the wake of financial crises, stablecoins are gaining adoption among digital currencies. We discuss how stablecoins help reduce the volatility of cryptocurrencies by surveying different types of stablecoins and their stability…
A quantum money scheme enables a trusted bank to provide untrusted users with verifiable quantum banknotes that cannot be forged. In this work, we report an experimental demonstration of the preparation and verification of unforgeable…
We introduce a natural variant of weighted voting games, which we refer to as k-Prize Weighted Voting Games. Such games consist of n players with weights, and k prizes, of possibly differing values. The players form coalitions, and the i-th…
In Weighted Model Counting (WMC) we assign weights to Boolean literals and we want to compute the sum of the weights of the models of a Boolean function where the weight of a model is the product of the weights of its literals. WMC was…
Suppose that attached to each site z in Z is a coin with bias theta(z), and only finitely many of these coins have non-zero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its…
We study the parameterized complexity of counting variants of Swap- and Shift-Bribery problems, focusing on the parameterizations by the number of swaps and the number of voters. We show experimentally that Swap-Bribery offers a new…
While powerful tools have been developed to analyze quantum query complexity, there are still many natural problems that do not fit neatly into the black box model of oracles. We create a new model that allows multiple oracles with…
The Taxman game has proven to be hard to solve optimally, so efforts have been made to find heuristic strategies that do well in practice. We present results on the NP-hardness of a variant of the game via an equivalence to a particular…
We consider the problems of weighted constrained sampling and weighted model counting, where we are given a propositional formula and a weight for each world. The first problem consists of sampling worlds with a probability proportional to…
We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…