A Survey on Continuous Time Computations

We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges

Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context

Holographic non-computers

We introduce the notion of holographic non-computer as a system which exhibits parametrically large delays in the growth of complexity, as calculated within the Complexity-Action proposal. Some known examples of this behavior include extremal black holes and near-extremal hyperbolic black holes. Generic black holes in higher-dimensional gravity also show non-computing features. Within the $1/d$ expansion of General Relativity, we show that large-$d$ scalings which capture the qualitative features of complexity, such as a linear growth regime and a plateau at exponentially long times, also exhibit an initial computational delay proportional to $d$. While consistent for large AdS black holes, the required `non-computing' scalings are incompatible with thermodynamic stability for Schwarzschild black holes, unless they are tightly caged.Comment: 23 pages, 7 figures. V3: References added. Figures updated. New discussion of small black holes in the canonical ensembl

Faster Geometric Algorithms via Dynamic Determinant Computation

The computation of determinants or their signs is the core procedure in many important geometric algorithms, such as convex hull, volume and point location. As the dimension of the computation space grows, a higher percentage of the total computation time is consumed by these computations. In this paper we study the sequences of determinants that appear in geometric algorithms. The computation of a single determinant is accelerated by using the information from the previous computations in that sequence. We propose two dynamic determinant algorithms with quadratic arithmetic complexity when employed in convex hull and volume computations, and with linear arithmetic complexity when used in point location problems. We implement the proposed algorithms and perform an extensive experimental analysis. On one hand, our analysis serves as a performance study of state-of-the-art determinant algorithms and implementations. On the other hand, we demonstrate the supremacy of our methods over state-of-the-art implementations of determinant and geometric algorithms. Our experimental results include a 20 and 78 times speed-up in volume and point location computations in dimension 6 and 11 respectively.Comment: 29 pages, 8 figures, 3 table