,
Arne Meier
,
Raghavendra Rao B. V.
Creative Commons Attribution 4.0 International license
Parameterised logspace-bounded computation is characterised by classes such as para𝐋 and paraβL. Especially, paraβL serves as a natural tractable counterpart of NL. Branching programs (BPs) are a natural model for space-bounded computation, notably for their characterisation of NL and NC¹. However, branching programs did not receive much attention in the landscape of parameterised computation. We consider parameterised variants of branching programs and its equivalent models such as skew circuits and weakly skew circuits. In particular, we study the power of these models with the k-bounded nondeterminism. We obtain characterization of paraβL in terms of branching programs, skew circuits and width bounded circuits with read-once access to k-bounded choice bits. We show that the parameterised problem of model checking existential first-order formulae with unbounded arity and restricted locality for the occurrence of variables can be done by weakly skew circuits with read-once access to choice bits. We also see that going beyond read-once restrictions quickly leads to intractability by showing that paraβL with two-pass over the choice bits contains MINI-SAT. Finally, we define the class XLP consisting of all parameterised problems solvable in f(k)⋅log n space and f(k)⋅n^O(1) time and obtain a complete problem for the class.
@InProceedings{haak_et_al:LIPIcs.IPEC.2026.2,
author = {Haak, Anselm and Meier, Arne and Rao B. V., Raghavendra},
title = {{On k-Bounded Nondeterminism for Branching Programs and Circuits}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {2:1--2:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.2},
URN = {urn:nbn:de:0030-drops-281757},
doi = {10.4230/LIPIcs.IPEC.2026.2},
annote = {Keywords: Parameterised Complexity, Circuit Complexity, Branching Programs, Logspace, k-Bounded Nondeterminism}
}