相关论文: Polynomial-Time Multi-Selectivity

In 2008, Bodirsky and Grohe showed that for every $\Pi_n^{\mathrm{P}}$-level of the Polynomial Hierarchy (PH) there are $\omega$-categorical Constraint Satisfaction Problems (CSPs) complete for this level. We show that, in fact, there are…

We show that ESO universal Horn logic (existential second logic where the first order part is a universal Horn formula) is insufficient to capture P, the class of problems decidable in polynomial time. This statement is true in the presence…

The PL geometric category of a polyhedron $P$, denoted $\hbox{plgcat}(P)$, provides a natural upper bound for the Lusternik--Schnirelmann category and it is defined as the minimum number of PL collapsible subpolyhedra of $P$ that cover $P$.…

We introduce techniques for proving superlinear conditional lower bounds for polynomial time problems. In particular, we show that CircuitSAT for circuits with m gates and log(m) inputs (denoted by log-CircuitSAT) is not decidable in…

It has long been conjectured that hypotheses spaces suitable for data that is compositional in nature, such as text or images, may be more efficiently represented with deep hierarchical networks than with shallow ones. Despite the vast…

Polynomial kernel regression is one of the standard and state-of-the-art learning strategies. However, as is well known, the choices of the degree of polynomial kernel and the regularization parameter are still open in the realm of model…

In the framework of computational complexity and in an effort to define a more natural reduction for problems of equivalence, we investigate the recently introduced kernel reduction, a reduction that operates on each element of a pair…

Building off of recent results on Keisler's order, we show that consistently, $\leq_{SP}$ has infinitely many classes. In particular, we define the property of $\leq k$-type amalgamation for simple theories, for each $2 \leq k < \omega$. If…

The polynomial-time hierarchy ($\mathrm{PH}$) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\mathrm{PH}$ does not collapse). Here, we study whether two…

The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of…

Frequent pattern mining is widely used to find ``important'' or ``interesting'' patterns in data. While it is not easy to mathematically define such patterns, maximal frequent patterns are promising candidates, as frequency is a natural…

Selection rules are often considered a hallmark of symmetry. When a symmetry is broken, e.g., by an external perturbation, the system exhibits selection rule deviations which are often analyzed by perturbation theory. Here, we employ…

The chain length of a set family $\mathcal{S} \subseteq 2^{[m]}$ is the largest ascending sequence of sets in containment order in the union-closure of $\mathcal S$. In this work, we provide a significantly simpler and more optimal…

We study syzygies of the Segre embedding of P(V_1) x ... x P(V_n), and prove two finiteness results. First, for fixed p but varying n and V_i, there is a finite list of "master p-syzygies" from which all other p-syzygies can be derived by…

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…

We study the problem of $P$-interpolation, where $P$ is a set of binary predicate symbols, for certain classes of local extensions of a base theory. For computing the $P$-interpolating terms, we use a hierarchic approach: This allows us to…

The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…

Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…

We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the…

By using a result from the numerical algebraic geometry package Bertini we show that (up to high numerical accuracy) a specific set of degree 6 and degree 9 polynomials cut out the secant variety $\sigma_{4}(\mathbb{P}^{2}\times \mathbb{P}…