Related papers: A Number Theoretic Interpolation Between Quantum a…
We introduce a new problem on the elementary symmetric polynomials $\sigma_k$, stemming from the constraint equations of some modified gravity theory. For which coefficients is a linear combination of $\sigma_k$ $1/p$-concave, with $0 \leq…
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…
In this paper, we present a polynomial-sized linear programming formulation of the Quadratic Assignment Problem (QAP). The proposed linear program is a network flow-based model. Hence, it provides for the solution of the QAP in polynomial…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input…
To the best of our knowledge this paper is the first attempt to introduce and study polynomial interpolation of the polynomial data given on arbitrary varieties. In the first part of the paper we present results on the solvability of such…
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
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.…
We describe two BQP-complete problems concerning properties of sparse graphs having a certain symmetry. The graphs are specified by efficiently computable functions which output the adjacent vertices for each vertex. Let i and j be two…
In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thom{\'e}, a quasi-polynomial time algorithm (QPA) is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…
This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…
We consider two families of polynomials $\mathbb{P}=\polP$ and $\mathbb{Q}=\polQ$\footnote{Here and below we consider only monic polynomials.} orthogonal on the real line with respect to probability measures $\mu$ and $\nu$ respectively.…
In the pinwheel problem, one is given an $m$-tuple of positive integers $(a_1, \ldots, a_m)$ and asked whether the integers can be partitioned into $m$ color classes $C_1,\ldots,C_m$ such that every interval of length $a_i$ has non-empty…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
The Matrix Torsion Problem (MTP) is: given a square matrix M with rational entries, decide whether two distinct powers of M are equal. It has been shown by Cassaigne and the author that the MTP reduces to the Matrix Power Problem (MPP) in…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…
The paper proposes a logical model of combinatorial problems, also it gives an example of a problem of the class NP that can not be solved in polynomial time on the dimension of the problem.
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…