Related papers: When Six Gates are Not Enough
This paper presents the first decoding algorithm for Gabidulin codes over Galois rings with provable quadratic complexity. The new method consists of two steps: (1) solving a syndrome-based key equation to obtain the annihilator polynomial…
We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…
Using logic gates is the traditional way of designing logic circuits. However, most of the minimization algorithms concern a limited set of gates (complete sets), like sum of products, exclusive-or sum of products, NAND gates, NOR gates…
We study the Cooperative Guarding problem for polygons with holes in a mobile multi-agents setting. Given a set of agents, initially deployed at a point in a polygon with $n$ vertices and $h$ holes, we require the agents to collaboratively…
In this paper, we prove that for a given biquaternion algebra over a field of characteristic two, one can move from one symbol presentation to another by at most three steps, such that in each step at least one entry remains unchanged. If…
Let Fq be a finite field with q=8 or q at least 16. Let S be a smooth cubic surface defined over Fq containing at least one rational line. We use a pigeonhole principle to prove that all the rational points on S are generated via tangent…
The class P is in fact a proper sub-class of NP. We explore topological properties of the Hamming space 2^[n] where [n]={1, 2,..., n}. With the developed theory, we show: (i) a theorem that is closely related to Erdos and Rado's sunflower…
We present a proof of the Harbourne-Hirschowitz conjecture for linear systems with base points of multiplicity seven or less. This proof uses a well-known degeneration of the projective plane, as well as a combinatorial technique that…
We show that an effective version of Siegel's Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems,…
The theory of matchgates is of interest in various areas in physics and computer science. Matchgates occur in e.g. the study of fermions and spin chains, in the theory of holographic algorithms and in several recent works in quantum…
Let $n \geq 6$ be an integer. We prove that the number of number fields with Galois group $A_n$ and absolute discriminant at most $X$ is asymptotically at least $X^{1/8 + O(1/n)}$. For $n \geq 8$ this improves upon the previously best known…
Multiplication over binary fields is a crucial operation in quantum algorithms designed to solve the discrete logarithm problem for elliptic curve defined over $GF(2^n)$. In this paper, we present an algorithm for constructing quantum…
It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…
In this note we investigate the role of Lloyd's computational bound in holographic complexity. Our goal is to translate the assumptions behind Lloyd's proof into the bulk language. In particular, we discuss the distinction between…
The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean…
Nguyen and Thomas (2016) claimed that they have found a method to compute the nucleoli of games with more than $50$ players using nested linear programs (LP). Unfortunately, this claim is false. They incorrectly applied the indirect proof…
A major open problem in current Galois theory is to characterize those profinite groups which appear as absolute Galois groups of various fields. Obtaining detailed knowledge of the structure of quotients and subgroup filtrations of Galois…
We prove three switching lemmas, for random restrictions for which variables are set independently; for random restrictions where variables are set in blocks (both due to Hastad [Hastad 86]); and for a distribution appropriate for the…
Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…
We propose an open question that seeks to generalise the Four Colour Theorem from two to three dimensions. As an appetiser, we show that 12 instead of four colours are both sufficient and necessary to colour every 2-complex that embeds in a…