相关论文: On the Complexity of Modulo-q Arguments and the Ch…

We initiate the study of the relationship between two complexity classes, BQP (Bounded-Error Quantum Polynomial-Time) and PPAD (Polynomial Parity Argument, Directed). We first give a conjecture that PPAD is contained in BQP, and show a…

We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This…

In 1990 Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem (CCV). He and Mayr showed that NL \subseteq CC \subseteq P, and proved that in addition to CCV several…

Consider a strongly $b$-multiplicative sequence and a prime $p$. Studying its $p$-rarefaction consists in characterizing the asymptotic behaviour of the sums of the first terms indexed by the multiples of $p$. The integer values of the…

Let p, ell be distinct primes and let q be a power of p. Let G be a connected compact Lie group. We show that there exists an integer b such that the mod ell cohomology of the classifying space of a finite Chevalley group G(F_q) is…

We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized…

We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. For NECKLACE SPLITTING, this result is specific to the important special case in which two…

We initiate a systematic study of ${\sf TFZPP}$, the class of total ${\sf NP}$ search problems solvable by polynomial time randomized algorithms. ${\sf TFZPP}$ contains a variety of important search problems such as…

Fix \epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \equiv p_{r+1} \equiv a \mod q and p_{r+1} - p_r < \epsilon\log p_r.…

We study the emptiness and $\lambda$-reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degree of ambiguity of the automaton and the size of its…

The proximal point algorithm (PPA) has been well studied in the literature. In particular, its linear convergence rate has been studied by Rockafellar in 1976 under certain condition. We consider a generalized PPA in the generic setting of…

The primitive-path analysis (PPA) {[}R. Everaers et al. Science 303, 823, (2004){]} is an algorithm that transforms a model polymer melt into its topologically equivalent mesh by removing excess contour length stored in thermal…

One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…

We propose a definition of equivariant (with respect to an Iwahori subgroup) $K$-theory of the formal power series model $\mathbf{Q}_{G}$ of semi-infinite flag manifold and prove the Pieri-Chevalley formula, which describes the product, in…

Toda proved in 1989 that the (discrete) polynomial time hierarchy, $\mathbf{PH}$, is contained in the class $\mathbf{P}^{#\mathbf{P}}$, namely the class of languages that can be decided by a Turing machine in polynomial time given access to…

Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23…

Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…

We show $\textsf{EOPL}=\textsf{PLS}\cap\textsf{PPAD}$. Here the class $\textsf{EOPL}$ consists of all total search problems that reduce to the End-of-Potential-Line problem, which was introduced in the works by Hubacek and Yogev (SICOMP…

Several decades ago the Proximal Point Algorithm (PPA) started to gain a long-lasting attraction for both abstract operator theory and numerical optimization communities. Even in modern applications, researchers still use proximal…

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…