Related papers: On the Tape-Number Problem for Deterministic Time …
The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials \cite{bakas2019taylor,Katsoprinakis2011,Nestoridis2011}. In particular, it is demonstrated that the…
There are several ideal boundaries and completions in General Relativity sharing the topological property of being sequential, i.e., determined by the convergence of its sequences and, so, by some limit operator $L$. As emphasized in a…
We show that it is decidable whether two regular languages of infinite trees are separable by a deterministic language, resp., a game language. We consider two variants of separability, depending on whether the set of priorities of the…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
Gapped domain walls, as topological line defects between 2+1D topologically ordered states, are examined. We provide simple criteria to determine the existence of gapped domain walls, which apply to both Abelian and non-Abelian topological…
In this paper, we address complexity issues for timeline-based planning over dense temporal domains. The planning problem is modeled by means of a set of independent, but interacting, components, each one represented by a number of state…
This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability…
Given a hierarchical plan (or schedule) with uncertain task times, we propose a deterministic polynomial (time and memory) algorithm for estimating the probability that its meets a deadline, or, alternately, that its {\em makespan} is less…
Let $A$ be Banach algebra over commutative ring $D$. The map $f:A\rightarrow A\ $ is called differentiable in the Gateaux sense, if $$f(x+a)-f(x)=\partial f(x)\circ a+o(a)$$ where the Gateaux derivative $\partial f(x)$ of map $f$ is linear…
In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a…
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on…
We define a class of Separation Logic formulae, whose entailment problem: given formulae $\phi, \psi_1, \ldots, \psi_n$, is every model of $\phi$ a model of some $\psi_i$? is 2EXPTIME-complete. The formulae in this class are existentially…
It is often conjectured that a choice of time function merely sets up a frame for the quantum evolution of gravitational field, meaning that all choices should be in some sense compatible. In order to explore this conjecture (and the…
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…
The lower and the upper irredundance numbers of a graph $G$, denoted $ir(G)$ and $IR(G)$ respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a…
The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…
Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…
The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1…
The gauge symmetries of a general dynamical system can be systematically obtained following either a Hamiltonean or a Lagrangean approach. In the former case, these symmetries are generated, according to Dirac's conjecture, by the first…
First class constraints in a canonical formalism of a gauge theory might generate transformations which map a state to its physically equivalent state. This is called Dirac's conjecture. There are two examples which may be candidates of…