Related papers: Parameterized Valiant's Classes
We study Polynomial Lawvere logic PL, a logic defined over the Lawvere quantale of extended positive reals with sum as tensor, to which we add multiplication, thereby obtaining a semiring structure. PL is designed for complex quantitative…
Nowhere dense classes of graphs are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations. From an algorithmic perspective, a characterisation of these classes in terms of uniform quasi-wideness,…
The VC-dimension is a well-studied and fundamental complexity measure of a set system (or hypergraph) that is central to many areas of machine learning. We establish several new results on the complexity of computing the VC-dimension. In…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the…
Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…
We study the parameterized complexity of winner determination problems for three prevalent $k$-committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin-Courant's…
The first-order (FO) model checking problem asks, given an FO sentence $\phi$ and a graph $G$, whether $G$ is a model of $\phi$. This problem is known to be $\mathsf{AW[*]}$-hard when parameterized by the quantifier rank of the formula. A…
We investigate the computational complexity of neural network verification in quantised settings. We distinguish three classes of Feedforward Neural Networks (FNNs): rational FNNs with exact rational weights, quantised FNNs whose weights…
We propose a series of new subalgebras of the $W_{1+\infty}$ algebra parametrized by polynomials $p(w)$, and study their quasifinite representations. We also investigate the relation between such subalgebras and the…
We construct parameterized families of imaginary (resp. real) quadratic fields whose class groups have $n$-rank at least $2$.
We study families of algebraic varieties parametrized by topological spaces and generalize some classical results such as Hilbert Nullstellensatz and primary decomposition of commutative rings. We show that there is an equivalence between…
The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise problems. It turns out that the promise…
Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some notions of solutions. Typical examples are satisfying…
Finding a cycle of lowest weight that represents a homology class in a simplicial complex is known as homology localization (HL). Here we address this NP-complete problem using parameterized complexity theory. We show that it is W[1]-hard…
We propose a generalization of quantization as a categorical way. For a fixed Poisson algebra quantization categories are defined as subcategories of R-module category with the structure of classical limits. We construct the generalized…
We define and study invariants which can be uniformly constructed for any gauge system. By a gauge system we understand an (anti-)Poisson supermanifold provided with an odd Hamiltonian self-commuting vector field called a homological vector…
A $r$-parameter ${u}_{\{\kappa_1, \kappa_2, \cdots, \kappa_r\}}(2)$ algebra is introduced. Finite unitary representations are investigated. This polynomial algebra reduces via a contraction procedure to the generalized Weyl-Heisenberg…
Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the…
In this paper, we investigate the parameterized complexity of model checking for Dependence Logic which is a well studied logic in the area of Team Semantics. We start with a list of nine immediate parameterizations for this problem,…