Related papers: The 95256-cap in PG(12; 4) is complete
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…
We prove that the quiver problem is NP complete.
We consider the problem of covering hypersphere by a set of spherical hypercaps. This sort of problem has numerous practical applications such as error correcting codes and reverse k-nearest neighbor problem. Using the reduction of non…
New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for 853<= q<= 2879 and q=3511,4096, 4523,5003,5347,5641,5843,6011. For q<= 2377 and q=2401,2417,2437, the relation…
We investigate the complexity of a puzzle that turns out to be NL-complete.
New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for 853 <= q <= 4561 and q\in T1\cup T2 where T1={173,181,193,229,243,257,271,277,293,343,373,409,443,449,457,…
We prove that deciding whether a given input word contains as subsequence every possible permutation of integers $\{1,2,\ldots,n\}$ is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as…
Given a property (graph class) $\Pi$, a graph $G$, and an integer $k$, the \emph{$\Pi$-completion} problem consists in deciding whether we can turn $G$ into a graph with the property $\Pi$ by adding at most $k$ edges to $G$. The…
We show that it is coNP-complete to decide whether a given proof structure of pomset logic is a correct proof net, using the graph-theoretic used in a previous paper of ours (arXiv:1901.10247).
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in…
An $n$-cap in $k$-dimensional projective space is a set of $n$ points so that no three lie on a line. In this note, we provide an algorithm to count the number of $n$-caps in $\mathbb{P}^3(\mathbb{F}_q)$, which follows from our recent paper…
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be difficult to solve, even with a quantum computer, but have the…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing. We uncover incompletenesses in existing…
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete
We prove upper and lower bounds for the threshold of the q-overlap-k-Exact cover problem. These results are motivated by the one-step replica symmetry breaking approach of Statistical Physics, and the hope of using an approach based on that…
Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in…
The paper studies completeness of the polynomials in weighted $L_p$-spaces on half line. It is shown that the completeness of polynomials does not hold for a wide class of weights, including the weights $\exp(- r t^q)$ with $r>0$ and $q\in…