Related papers: On the principal impossibility to prove P=NP
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…
To what extent can our limited set of observations be used to pin down the specifics of a ``Theory of Everything''? In the limit where the links are arbitrarily tenuous, a ``Theory of Everything'' might become a ``Theory of Anything''. A…
Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model…
We claim to resolve the P=?NP problem via a formal argument for P=NP.
We study a class of hypothesis testing problems in which, upon observing the realization of an $n$-dimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether…
A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…
The optimal matching of point clouds in $\mathbb{R}^d$ is a combinatorial problem; applications in statistics motivate to consider random point clouds, like the Poisson point process. There is a crucial dependance on dimension $d$, with…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with…
We present a definition of the class NP in combinatorial context as the set of languages of structures defined by finitely many forbidden lifted substructures. We apply this to special syntactically defined subclasses and show how they…
The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…
The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combinatory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven…
Heisenberg's uncertainty principle states that it is not possible to compute both the position and momentum of an electron with absolute certainty. However, this computational limitation, which is central to quantum mechanics, has no…
State minimization of combinatorial filters is a fundamental problem that arises, for example, in building cheap, resource-efficient robots. But exact minimization is known to be NP-hard. This paper conducts a more nuanced analysis of this…
The unification of gravity to the other forces has been a major problem for most of the last century. I use a modification to Newtonian gravitation to extract the strong and weak nuclear coupling constants. Some of the possible implications…
Motivated by the theory of proof complexity generators we consider the following $\Sigma^p_2$ search problem $\mbox{DD}_P$ determined by a propositional proof system $P$: given a $P$-proof $\pi$ of a disjunction $\bigvee_i {\alpha}_i$, no…