In mathematics,spciticially in abstract algebra and its applications, discrete loga-rithms are group -theoretic analogues of ordinary logarithms. The problem of computing both problems are difficult, alogrithms from one problem are often adapted to the other, and the difficulty of both problems has been exploited to construct various cryptographic system. This work describes an application of t...

We study the computational complexity of controlling the result of an election by breaking ties strategically. This problem is equivalent to the problem of deciding the winner of an election under parallel universes tie-breaking. When the chair of the election is only asked to break ties to choose between one of the co-winners, the problem is trivially easy. However, in multi-round elections, w...

In this paper we analyse the impact of non-stationary volatility on the recently developed unit root tests which allow for a possible break in trend occurring at an unknown point in the sample, considered in Harris, Harvey, Leybourne and Taylor (2008) [HHLT]. HHLT’s analysis hinges on a novel break fraction estimator which, where a break in trend occurs, is consistent for the true break fractio...