Uniformity within parameterized circuit classes

DOI10.4230/LIPICS.IPEC.2025.27MaRDI QIDQ7356356zbMATH OpenFDO

Authors Steef Hegeman, Jan Martens, Alfons W. Laarman

Publication date 23 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2025.27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• Describing parameterized complexity classes
• Fast parallel fixed-parameter algorithms via color coding
• Gap-languages and log-time complexity classes
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• Integer multiplication in time \(O(n\log n)\)
• On the space and circuit complexity of parameterized problems: classes and completeness
• On uniform circuit complexity
• On uniformity and circuit lower bounds
• On uniformity within \(NC^ 1\)
• Parallel Multivariate Meta-Theorems
• Parameterized circuit complexity of model-checking on sparse structures
• Parametrized complexity theory.
• Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
• Some lower bounds in parameterized \(\mathrm{AC}^{0}\)

This page was built for publication: Uniformity within parameterized circuit classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356356)