Parameterized Valiant's Classes

07/29/2019
by   Markus Blaeser, et al.
0

We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate reductions and completeness notions. Our main contribution is the VW[1]-completeness proof of the parameterized clique family. This proof is far more complicated than in the Boolean world. It requires some new concepts like composition theorems for bounded exponential sums and Boolean-arithmetic formulas. In addition, we also look at two polynomials linked to the permanent with vastly different parameterized complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/05/2017

Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth

In this paper we give a characterization of both Boolean and arithmetic ...
research
05/04/2023

On the parameterized complexity of the Perfect Phylogeny problem

This paper categorizes the parameterized complexity of the algorithmic p...
research
03/05/2020

Characterizations and approximability of hard counting classes below #P

An important objective of research in counting complexity is to understa...
research
04/27/2019

Parameterised Counting Classes with Bounded Nondeterminism

Stockhusen and Tantau (IPEC 2013) introduced the operators paraW and par...
research
02/14/2021

A note on VNP-completeness and border complexity

In 1979 Valiant introduced the complexity class VNP of p-definable famil...
research
12/09/2021

A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More

In the past a few years, many interesting inapproximability results have...

Please sign up or login with your details

Forgot password? Click here to reset