相关论文: "How many $1$'s are needed?" revisited

We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…

Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This…

This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…

For a set of natural numbers $A$, let $R_{A}(n)$ be the number of representations of a natural number $n$ as the sum of two terms from $A$. Many years ago, Nathanson studied the conditions for the set $A$ and $B$ of natural numbers that are…

In this tribute to Neil Sloane, we revisit the first sequence in the On-Line Encyclopedia of Integer Sequences, sequence A435 (1, 8, 78, 944, 13800, 237432, 4708144, 105822432, ...), that he encountered when he was a graduate student, and…

Complexity of patterns is a key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal…

In this paper, we consider first-order logic over unary functions and study the complexity of the evaluation problem for conjunctive queries described by such kind of formulas. A natural notion of query acyclicity for this language is…

We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We show…

Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to which a sequence is random-like. However, each of them…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct. Letting N be the number of elements in the input list,…

An algorithm for computing /pi(N) is presented.It is shown that using a symmetry of natural numbers we can easily compute /pi(N).This method relies on the fact that counting the number of odd composites not exceeding N suffices to calculate…

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…

The arithmetic complexity counts the number of algebraically independent entries in the periodic continued fraction $\theta=[b_1,\dots, b_N, \overline{a_1,\dots,a_k}]$. If $\mathscr{A}_{\theta}$ is a noncommutative torus corresponding to…

In this paper we show how the complexity of Linear Programming (LP) decoder can decrease. We use the degree 3 check equation to model all variation check degrees. The complexity of LP decoding is directed relative to the number of…

We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $\Delta\_{ij}$,…

The LMC-complexity introduced by Lopez-Ruiz, Mancini and Calbet [Phys. Lett. A 209, 321-326 (1995)] is calculated for different physical situations: one instance of classical statistical mechanics, normal and exponential distributions, and…

This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…

Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…