相关论文: A Downward Collapse within the Polynomial Hierarch…
Downward translation of equality refers to cases where a collapse of some pair of complexity classes would induce a collapse of some other pair of complexity classes that (a priori) one expects are smaller. Recently, the first downward…
During the past decade, nine papers have obtained increasingly strong consequences from the assumption that boolean or bounded-query hierarchies collapse. The final four papers of this nine-paper progression actually achieve downward…
"Period collapse" refers to any situation where the period of the Ehrhart function of a polytope is less than the denominator of that polytope. We study several interesting situations where this occurs, primarily involving triangles. For…
A problem $\mathcal{P}$ is considered downward self-reducible, if there exists an efficient algorithm for $\mathcal{P}$ that is allowed to make queries to only strictly smaller instances of $\mathcal{P}$. Downward self-reducibility has been…
The top part of the preceding figure [figure appears in actual paper] shows some classes from the (truth-table) bounded-query and boolean hierarchies. It is well-known that if either of these hierarchies collapses at a given level, then all…
We define polygonal dynamics as a family of dynamical systems acting on points in projective spaces. The most famous example is the pentagram map. Similar collapsing phenomena seem to occur in most of these systems. We prove it in some…
A permutation $\sigma=\sigma_1 \sigma_2 \cdots \sigma_n$ has a descent at $i$ if $\sigma_i>\sigma_{i+1}$. A descent $i$ is called a peak if $i>1$ and $i-1$ is not a descent. The size of the set of all permutations of $n$ with a given…
The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…
The arithmetical hierarchy (AH) is similar to the polynomial hierarchy (PH). Unlike the PH, the AH does not collapse relative to any oracle. A language in the (k + 1)-st level of the AH is computable enumerable (c.e.) relative to the kth…
Hemaspaandra et al. proved that, for $m > 0$ and $0 < i < k - 1$: if $\Sigma_i^p \BoldfaceDelta DIFF_m(\Sigma_k^p)$ is closed under complementation, then $DIFF_m(\Sigma_k^p) = coDIFF_m(\Sigma_k^p)$. This sharply asymmetric result fails to…
A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for c not equal to c'. If we keep in place the latter axiom but allow for more…
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are equal. We prove that these equalities hold for any…
We introduce the entangled quantum polynomial hierarchy $\mathsf{QEPH}$ as the class of problems that are efficiently verifiable given alternating quantum proofs that may be entangled with each other. We prove $\mathsf{QEPH}$ collapses to…
A categorical point of view about minimization in subrecursive classes is presented by extending the concept of Symmetric Monoidal Comprehension to that of Distributive Minimization Comprehension. This is achieved by endowing the former…
In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on the idea of relaxing MKP to a {\em Bounded Sequential Multiple Knapsack Problem}, i.e., a multiple knapsack problem in which item sizes are…
A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…
A $P_{k+2}$ polynomial lifting operator is defined on polygons and polyhedrons. It lifts discontinuous polynomials inside the polygon/polyhedron and on the faces to a one-piece $P_{k+2}$ polynomial. With this lifting operator, we prove that…
In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise problems. It turns out that the promise…