相关论文: A generalization of extension complexity that capt…

We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…

Let X be a space of constant curvature and P be a convex polyhedron in X. A Coxeter decomposition of the polyhedron P is a decomposition of P into finitely many Coxeter polyhedra, such that any two polyhedra having a common facet are…

The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…

We prove that the problem of minimizing the number of integer points inparallel translations of a rational convex polytope in $\mathbb{R}^6$ is NP-hard. We apply this result to show that given a rational convex polytope $P \subset…

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem.…

We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its…

Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.…

We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…

The Hospital Residents setting models important problems like school choice, assignment of undergraduate students to degree programs, among many others. In this setting, fixed quotas are associated with the programs that limit the number of…

Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…

We introduce the notion of a generalised symmetry M of a hamiltonian H. It is a symmetry which has been broken in a very specific manner, involving ladder operators R and R*. In Theorem 1 these generalised symmetries are characterised in…

In this paper it is shown that the compact linearization approach, that has been previously proposed only for binary quadratic problems with assignment constraints, can be generalized to arbitrary linear equations with positive coefficients…

The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…

This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if…

Using the theory of analytic functions of several complex variables, we prove that if an analytic function in several variables satisfies a system of $q$-partial differential equations, then, it can be expanded in terms of the product of…

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

Let $X$ and $Y$ be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group $G$. Assuming that $Y$ is $d$-connected and $\dim X\le 2d$, for some $d\geq 1$, we provide an…