Related papers: Complexity Classes and Completeness in Algebraic G…
We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic problems of a code. While these problems are known to be hard for…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
Let G be a simple complex algebraic group. By using a notion of a G-category we define invariants of tangles with flat G-connections in their complements. We also show that quantized universal enveloping algebras at roots of unity provide…
Let $k$ be a field. We characterize the group schemes $G$ over $k$, not necessarily affine, such that $\mathsf{D}_{\mathrm{qc}}(B_kG)$ is compactly generated. We also describe the algebraic stacks that have finite cohomological dimension in…
In part I of this work we studied the spaces of real algebraic cycles on a complex projective space P(V), where V carries a real structure, and completely determined their homotopy type. We also extended some functors in K-theory to…
Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…
In process mining, alignments quantify the degree of deviation between an observed event trace and a business process model and constitute the most important conformance checking technique. We study the algorithmic complexity of computing…
Metric algebras are metric variants of $\Sigma$-algebras. They are first introduced in the field of universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. Recently a similar notion of…
We study three problems related to the computational complexity of the popular game Minesweeper. The first is consistency: given a set of clues, is there any arrangement of mines that satisfies it? This problem has been known to be…
The algebraic geometry of a universal algebra $\mathbf{A}$ is defined as the collection of solution sets of term equations. Two algebras $\mathbf{A}_1$ and $\mathbf{A}_2$ are called algebraically equivalent if they have the same algebraic…
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e.,…
A convex geometry is finite zero-closed closure system that satisfies the anti-exchange property. Complexity results are given for two open problems related to representations of convex geometries using implication bases. In particular, the…
In this paper we explore the noncommutative analogues, $\mathrm{VP}_{nc}$ and $\mathrm{VNP}_{nc}$, of Valiant's algebraic complexity classes and show some striking connections to classical formal language theory. Our main results are the…
The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…
A class of associative (super) algebras is presented, which naturally generalize both the symmetric algebra $Sym(V)$ and the wedge algebra $\wedge (V)$, where $V$ is a vector-space. These algebras are in a bijection with those subsets of…
Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems. A high level overview of this research plan and the results obtained so far was presented in a series of three lectures in the Institute of Advanced…
Theoretical complexity is a vital subfield of computer science that enables us to mathematically investigate computation and answer many interesting queries about the nature of computational problems. It provides theoretical tools to assess…