Related papers: Nondeterminisic Sublinear Time Has Measure 0 in P
Inference and prediction under the sparsity assumption have been a hot research topic in recent years. However, in practice, the sparsity assumption is difficult to test, and more importantly can usually be violated. In this paper, to study…
The study considers advantages of the introduced measure of time based on the entropy change under irreversible processes (entropy production). Using the example of non-equilibrium expansion of an ideal gas in vacuum, such a measure is…
In this article, we discuss the question of whether P equals NP, we do not follow the line of research of many researchers, which is to try to find such a problem Q, and the problem Q belongs to the class of NP-complete, if the problem Q is…
The present work proves that P=NP. The proof, presented in this work, is a constructive one: the program of a polynomial time deterministic multi-tape Turing machine M_ExistsAcceptingPath, that determines if there exists an accepting…
Piecewise testable languages form the first level of the Straubing-Th\'erien hierarchy. The membership problem for this level is decidable and testing if the language of a DFA is piecewise testable is NL-complete. The question has not yet…
We resolve a long-standing open question on the relationship between measure-theoretic dynamical complexity and symbolic complexity by establishing the exact word complexity at which measure-theoretic strong mixing manifests: For every…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
We study nonlinear energy transfer and the existence of stationary measures in a class of degenerately forced SDEs on $\mathbb R^d$ with a quadratic, conservative nonlinearity $B(x,x)$ constrained to possess various properties common to…
We consider the structural change in a class of discrete valued time series that the conditional distribution follows a one-parameter exponential family. We propose a change-point test based on the maximum likelihood estimator of the…
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…
Metric Temporal Logic $\mathsf{MTL}[\until_I,\since_I]$ is one of the most studied real time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of…
We give sufficient conditions for a predicate P in a complete theory T to be stably embedded: P with its induced 0-definable structure has "finite rank", P has NIP in T and P is 1-stably embedded. This generalizes recent work by Hasson and…
We study stochastically forced semilinear parabolic PDE's of the Ginzburg-Landau type. The class of forcings considered are white noises in time and colored smooth noises in space. Existence of the dynamics in $L^\infty$, as well as…
This paper shows that the problem of testing hypotheses in moment condition models without any assumptions about identification may be considered as a problem of testing with an infinite-dimensional nuisance parameter. We introduce a…
Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…
Many commonly used test statistics are based on a norm measuring the evidence against the null hypothesis. To understand how the choice of a norm affects power properties of tests in high dimensions, we study the consistency sets of…
In this paper, in order to test whether changes have occurred in a nonlinear parametric regression, we propose a nonparametric method based on the empirical likelihood. Firstly, we test the null hypothesis of no-change against the…
The power of real-time Turing machines using sublinear space is investigated. In contrast to a claim appearing in the literature, such machines can accept non-regular languages, even if working in deterministic mode. While maintaining a…
Model checking for Halpern and Shoham's interval temporal logic HS has been recently investigated in a systematic way, and it is known to be decidable under three distinct semantics. Here, we focus on the trace-based semantics, where the…
For control systems in discrete time, this paper discusses measure-theoretic invariance entropy for a subset Q of the state space with respect to a quasi-stationary measure obtained by endowing the control range with a probability measure.…