No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth

被引：4

作者：

Razgon, Igor ^{[1
]}

机构：

[1] Univ London, Dept Comp Sci & Informat Syst, London, England

来源：

PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014 | 2014年 / 8894卷

关键词：

D O I：

10.1007/978-3-319-13524-3_27

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 n(ck) 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.

引用

页码：319 / 331

页数：13

共 50 条

[1] On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
Razgon, Igor
ALGORITHMICA, 2016, 75 (02) : 277 - 294
[2] On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
Igor Razgon
Algorithmica, 2016, 75 : 277 - 294
[3] On Tseitin Formulas, Read-Once Branching Programs and Treewidth
Glinskih, Ludmila
Itsykson, Dmitry
THEORY OF COMPUTING SYSTEMS, 2021, 65 (03) : 613 - 633
[4] On Tseitin Formulas, Read-Once Branching Programs and Treewidth
Glinskih, Ludmila
Itsykson, Dmitry
COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2019, 11532 : 143 - 155
[5] On Tseitin Formulas, Read-Once Branching Programs and Treewidth
Ludmila Glinskih
Dmitry Itsykson
Theory of Computing Systems, 2021, 65 : 613 - 633
[6] Complexity theoretical results on nondeterministic graph-driven read-once branching programs
Bollig, B
STACS 2003, PROCEEDINGS, 2003, 2607 : 295 - 306
[7] Complexity theoretical results on nondeterministic graph-driven read-once branching programs
Bollig, B
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2003, 37 (01): : 51 - 66
[8] Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
Bollig, B
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2001, 35 (02): : 149 - 162
[9] Read-Once Branching Programs for Tree Evaluation Problems
Iwama, Kazuo
Nagao, Atsuki
ACM TRANSACTIONS ON COMPUTATION THEORY, 2019, 11 (01)
[10] The distinguishability of product distributions by read-once branching programs
Steinberger, John
2013 IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2013, : 248 - 254

← 1 2 3 4 5 →