Related papers: Algebraic Complexity Classes
Since the introduction of the concept of isotopism of algebras by Albert in 1942, a prolific literature on the subject has been developed for distinct types of algebras. Nevertheless, there barely exists any result on the problem of…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
We determine the derivation algebras and the isomorphism classes of a family of the simple Lie algebras introduced recently by Xu [Manuscripta Math 100 (1999), 489-518]. The structure space of these algebras is given explicitly.
We show new upper and lower bounds for the complexity of implementation of a sequence of Boolean matrices proposed by Kaski et al. (arXiv:1208.0554) with additive circuits.
The search for a geometric interpretation of the constrained brackets of Dirac led to the definition of the Courant bracket. The search for the right notion of a "double" for Lie bialgebroids led to the definition of Courant algebroids. We…
Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…
The notion of Courant algebroid was introduced by Liu, Weinstein and Xu in 1997. Its definition consists of five axioms and an assumption for a derivation. It is shown that two of the axioms and the assumption for the derivation follow from…
We introduce a new class of graded rings extending the class of generalized Weyl algebras. These rings are orders in crossed products of the most general type, and we introduce their basic structure theory. We provide an extensive list of…
A novel algebra underlying integrable systems is shown to generate and unify a large class of quantum integrable models with given $R$-matrix, through reductions of an ancestor Lax operator and its different realizations. Along with known…
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…
We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…
This article is a short introduction to generic case complexity, which is a recently developed way of measuring the difficulty of a computational problem while ignoring atypical behavior on a small set of inputs. Generic case complexity…
Drawing on the classic paper by Chellas "Basic conditional logic" (1975), we propose a general algebraic framework for studying a binary operation of conditional that models universal features of the "if..., then..." connective as strictly…
Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…
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…
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…
Geometric complexity theory (GCT) is an approach towards separating algebraic complexity classes through algebraic geometry and representation theory. Originally Mulmuley and Sohoni proposed (SIAM J Comput 2001, 2008) to use occurrence…
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.…
Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish a quantum equivalent of classical parameterized complexity…