Sciweavers

IPL
2016
43views more  IPL 2016»
7 years 11 months ago
On the complexity of exchanging
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...
Xavier Molinero, Martin Olsen, Maria J. Serna
IPL
2016
54views more  IPL 2016»
7 years 11 months ago
On the greedy algorithm for the Shortest Common Superstring problem with reversals
Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski...
IPL
2016
42views more  IPL 2016»
7 years 11 months ago
Introducing the counter mode of operation to Compressed Sensing based encryption
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...
Robin Fay
IPL
2016
53views more  IPL 2016»
7 years 11 months ago
The complexity of the Kth largest subset problem and related problems
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...
Christoph Haase, Stefan Kiefer
IPL
2016
47views more  IPL 2016»
7 years 11 months ago
A Denial of Service attack against fair computations using Bitcoin deposits
Bitcoin supports complex transactions where the recipient of a transaction can be programmatically determined. Using these transactions, multiparty computation protocols that aim ...
Jethro G. Beekman
IPL
2016
47views more  IPL 2016»
7 years 11 months ago
VNP=VP in the multilinear world
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...
Meena Mahajan, Nitin Saurabh, Sébastien Tav...
IPL
2016
51views more  IPL 2016»
7 years 11 months ago
On the semantics of Strategy Logic
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...
Patricia Bouyer, Patrick Gardy, Nicolas Markey
IPL
2016
47views more  IPL 2016»
7 years 11 months ago
The (non-)existence of perfect codes in Fibonacci cubes
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...