Related papers: Capturing Bisimulation-Invariant Exponential-Time …
The Team Orienteering Problem with Service Times and Mandatory & Incompatible Nodes (TOP-ST-MIN) is a variant of the classic Team Orienteering Problem (TOP), which includes three novel features that stem from two real-world problems…
Conditional inference on arbitrary subsets of variables is a core problem in probabilistic inference with important applications such as masked language modeling and image inpainting. In recent years, the family of Any-Order Autoregressive…
Bi-factor and second-order models based on copulas are proposed for item response data, where the items can be split into non-overlapping groups such that there is a homogeneous dependence within each group. Our general models include the…
We consider two characterisations of the may and must testing preorders for a probabilistic extension of the finite pi-calculus: one based on notions of probabilistic weak simulations, and the other on a probabilistic extension of a…
We combine integer linear programming and recent advances in Monadic Second-Order model checking to obtain two new algorithmic meta-theorems for graphs of bounded vertex-cover. The first shows that cardMSO1, an extension of the well-known…
We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
We show that the usual Born-Oppenheimer type of approximation used in quantum gravity, in which a semiclassical time parameter emerges from a weak-coupling expansion of the Wheeler-DeWitt constraint, leads to a unitary theory at least up to…
In this article, we describe an efficient method for computing Teitelbaum's $p$-adic $\mathcal{L}$-invariant. These invariants are realized as the eigenvalues of the $\mathcal{L}$-operator acting on a space of harmonic cocycles on the…
We consider how changes in transfinite machine architecture can sometimes alter substantially their capabilities. We approach the subject by answering three open problems touching on: firstly differing halting time considerations for…
We consider the Fourier-Laplace transforms of a broad class of polynomial Ornstein-Uhlenbeck (OU) volatility models, including the well-known Stein-Stein, Sch\"obel-Zhu, one-factor Bergomi, and the recently introduced Quintic OU models…
This paper presents a new semantic method for proving lower bounds in computational complexity. We use it to prove that maxflow, a PTIME complete problem, is not computable in polylogarithmic time on parallel random access machines (PRAMs)…
We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…
A single-step high-order implicit time integration scheme for the solution of transient and wave propagation problems is presented. It is constructed from the Pad\'e expansions of the matrix exponential solution of a system of first-order…
The time-ordered exponential representation of a complex time evolution operator in the interaction picture is studied. Using the complex time evolution, we prove the Gell-Mann -- Low formula under certain abstract conditions, in…
We prove some variants of the exponential formula and apply them to the multivariate Tutte polynomials (also known as Potts-model partition functions) of graphs. We also prove some further identities for the multivariate Tutte polynomial,…
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus. This allows a direct interpretation of classical proofs, avoiding the usual negative translation to…
We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…
In this article, we introduce and develop the notion of parametrised Poincar\'{e} duality in the formalism of parametrised higher category theory by Martini-Wolf, in part generalising Cnossen's theory of twisted ambidexterity to the…