We analyze the computational complexity of the problem of deciding whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j giv...
Compressed Sensing based encryption is computationally secure in a one time key scenario, but it does not resist chosen plaintext attacks (CPA) due to the deterministic encryption...
We show that the Kth largest subset problem and the Kth largest m-tuple problem are in PP and hard for PP under polynomial-time Turing reductions. Several problems from the litera...
Bitcoin supports complex transactions where the recipient of a transaction can be programmatically determined. Using these transactions, multiparty computation protocols that aim ...
In this note, we show that over fields of any characteristic, exponential sums of Boolean instantiations of polynomials computed by multilinear circuits can be computed by multil...
We define and study a slight variation on the semantics of Strategy Logic: while in the classical semantics, all strategies are shifted during the evaluation of temporal modaliti...
The Fibonacci cube Γn is obtained from the n-cube Qn by removing all the vertices that contain two consecutive 1s. It is proved that Γn admits a perfect code if and only if n ...
Ali Reza Ashrafi, Jernej Azarija, Azam Babai, Khad...