Parameterised counting in logspace
From MaRDI portal
Cites work
- Block interpolation: a framework for tight exponential-time counting complexity
- Circuits over PP and PL
- Color-coding
- Completeness results for parameterized space classes
- Computational Complexity
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\)
- Counting matchings of size \(k\) is \#W[1]-hard
- Counting of Teams in First-Order Team Logics
- Describing parameterized complexity classes
- Fast parallel fixed-parameter algorithms via color coding
- Gap-definable counting classes
- Homomorphisms are a good basis for counting small subgraphs
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 1332669 (Why is no real title available?)
- scientific article; zbMATH DE number 612169 (Why is no real title available?)
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- scientific article; zbMATH DE number 1929968 (Why is no real title available?)
- scientific article; zbMATH DE number 7378390 (Why is no real title available?)
- Nondeterministic NC^1 computation
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- On the space and circuit complexity of parameterized problems: classes and completeness
- Parameterized analogues of probabilistic computation
- Parameterized counting of trees, forests and matroid bases
- Parametrized complexity theory.
- PP is as Hard as the Polynomial-Time Hierarchy
- Query evaluation via tree-decompositions
- Relationships among $PL$, $\#L$, and the determinant
- Relativization and interactive proof systems in parameterized complexity theory
- Relativized alternation and space-bounded computation
- Some lower bounds in parameterized \(\mathrm{AC}^0\)
- The complexity of computing the permanent
- The complexity of counting homomorphisms seen from the other side
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The complexity of matrix rank and feasible systems of linear equations
- The fine classification of conjunctive queries and parameterized logarithmic space
- The parameterised complexity of counting even and odd induced subgraphs
- The Parameterized Complexity of Counting Problems
- The PL Hierarchy Collapses
This page was built for publication: Parameterised counting in logspace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231564)
