Related papers: An Oracle Strongly Separating Deterministic Time f…
In the nineties Immerman and Medina initiated the search for syn- tactic tools to prove NP-completeness. In their work, amongst several results, they conjecture that the NP-completeness of a problem defined by the conjunction of a sentence…
We prove Kolmogorov's law of the iterated logarithm for noncommutative martingales. The commutative case was due to Stout. The key ingredient is an exponential inequality proved recently by Junge and the author.
We introduce PHFL, a probabilistic extension of higher-order fixpoint logic, which can also be regarded as a higher-order extension of probabilistic temporal logics such as PCTL and the $\mu^p$-calculus. We show that PHFL is strictly more…
We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Pad\'e approximation. In conjunction with Honda's proof of the…
We show that for every conjunctive query, the complexity of evaluating it on a probabilistic database is either \PTIME or #\P-complete, and we give an algorithm for deciding whether a given conjunctive query is \PTIME or #\P-complete. The…
The aim of this paper is to prove a Kolmogorov-type result for a nearly-integrable Hamiltonian, quadratic in the actions, with an aperiodic time dependence. The existence of a torus with a prefixed Diophantine frequency is shown in the…
A classic result of Paul, Pippenger, Szemer\'edi and Trotter states that DTIME(n) is strictly contained in NTIME(n). The natural question then arises: could DTIME(t(n)) be contained in NTIME(n) for some superlinear time-constructible…
Classical results of Bennett and Gill (1981) show that with probability 1, $P^A \neq NP^A$ relative to a random oracle $A$, and with probability 1, $P^\pi \neq NP^\pi \cap coNP^\pi$ relative to a random permutation $\pi$. Whether $P^A =…
In this article we investigate the temporal regularity of strong solutions to the stochastic $p$-\com{L}aplace system in the degenerate setting, $p \in [2,\infty)$, driven by a multiplicative nonlinear stochastic forcing. We establish $1/2$…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…
Usually, it is supposed that irreversibility of time appears only in macrophysics. Here, we attempt to introduce the microphysical arrow of time assuming that at a fundamental level nature could be non-associative. Obtaining numerical…
Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and…
Diverse applications of Kolmogorov complexity to learning [CIKK16], circuit complexity [OPS19], cryptography [LP20], average-case complexity [Hir21], and proof search [Kra22] have been discovered in recent years. Since the running time of…
We examine the unitarity issue in the recently proposed time-ordered perturbation theory on noncommutative (NC) spacetime. We show that unitarity is preserved as long as the interaction Lagrangian is explicitly Hermitian. We explain why it…
The paper discusses recent proposals by Carroll and Chen, as well as Barbour, Koslowski, and Mercati to explain the (thermodynamic) arrow of time without a Past Hypothesis, i.e., the assumption of a special (low-entropy) initial state of…
We prove an intrinsic Taylor-like formula for a class of Lie groups arising in the study of some sub-elliptic differential operators, namely the Kolmogorov operators. The estimate of the remainder is in terms of the intrinsic norm induced…
In this article, we shall describe some of the most interesting topics in the subject of Complexity Science for a general audience. Anyone with a solid foundation in high school mathematics (with some calculus) and an elementary…
This paper studies the complexity of query evaluation for databases whose relations are partially ordered; the problem commonly arises when combining or transforming ordered data from multiple sources. We focus on queries in a useful…
The word "complexity" is most often used as a meta--linguistic expression referring to certain intuitive characteristics of a natural system and/or its scientific description. These characteristics may include: sheer amount of data that…
We present tableau calculi for some logics of nonmonotonic reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative and rational logics. Our…