Related papers: Parameterized Valiant's Classes
Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights…
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 introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent…
We introduce a term algebra as a new formal specification language for the coordinating architectures of distributed systems consisting of a finite yet unbounded number of components. The language allows to describe infinite sets of systems…
Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided for three successively more general classes of causal models: (1) the class of recursive theories (those…
We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, called parametric proof spaces, which exploits the underlying…
By limiting the range of the predicate variables in a second-order language one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note we provide an infinitary strongly…
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest is the sample complexity: the number of samples required to…
In this paper, we introduce a new class of parameterized problems, which we call XALP: the class of all parameterized problems that can be solved in $f(k)n^{O(1)}$ time and $f(k)\log n$ space on a non-deterministic Turing Machine with…
We define a family of universal finite-dimensional highest weight modules for affine Lie algebras, we call these Weyl modules. We conjecture that these are the classical limits of the irreducible finite--dimensional representations of the…
In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…
In 1979 Valiant introduced the complexity class VNP of p-definable families of polynomials, he defined the reduction notion known as p-projection and he proved that the permanent polynomial and the Hamiltonian cycle polynomial are…
Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided for three successively more general classes of causal models: (1) the class of recursive theories (those…
It is stated that Boolean set algebras with unit V, where V is a union of Cartesian products, are axiomatizable. The axiomatization coincides with that of cylindric polyadic equality algebras (class CPE). This is an algebraic representation…
We overview classifications of simple infinite-dimensional complex $\mathbb{Z}$-graded Lie (super)algebras of polynomial growth, and their deformations. A subset of such Lie (super)algebras consist of vectorial Lie (super)algebras whose…
Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…
We investigate machine models similar to Turing machines that are augmented by the operations of a first-order structure $\mathcal{R}$, and we show that under weak conditions on $\mathcal{R}$, the complexity class $\text{NP}(\mathcal{R})$…
Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…