TY - GEN
T1 - No small nondeterministic read-once branching programs for CNFs of bounded treewidth
AU - Razgon, Igor
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2014.
PY - 2014/1/1
Y1 - 2014/1/1
N2 - In this paper, given a parameter k, we demonstrate an infinite class of CNFs of treewidth at most k of their primal graphs such that equivalent nondeterministic read-once branching programs (NROBPS) are of size at least nck for some universal constant c. Thus we rule out the possibility of fixed-parameter tractable space complexity of NROBPS parameterized by the smallest treewidth of equivalent CNFs.
AB - In this paper, given a parameter k, we demonstrate an infinite class of CNFs of treewidth at most k of their primal graphs such that equivalent nondeterministic read-once branching programs (NROBPS) are of size at least nck for some universal constant c. Thus we rule out the possibility of fixed-parameter tractable space complexity of NROBPS parameterized by the smallest treewidth of equivalent CNFs.
UR - https://www.scopus.com/pages/publications/84920026044
U2 - 10.1007/978-3-319-13524-3_27
DO - 10.1007/978-3-319-13524-3_27
M3 - Conference contribution
AN - SCOPUS:84920026044
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 319
EP - 331
BT - Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Revised Selected Papers
A2 - Cygan, Marek
A2 - Heggernes, Pinar
PB - Springer Verlag
T2 - 9th International Symposium on Parameterized and Exact Computation, IPEC 2014
Y2 - 10 September 2014 through 12 September 2014
ER -