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 条

[41] A lower bound for integer multiplication on randomized ordered read-once branching programs
Ablayev, F
Karpinski, M
INFORMATION AND COMPUTATION, 2003, 186 (01) : 78 - 89
[42] Proofs of proximity for context-free languages and read-once branching programs
Goldreich, Oded
Gur, Tom
Rothblum, Ron D.
INFORMATION AND COMPUTATION, 2018, 261 : 175 - 201
[43] On the size of randomized OBDDs and read-once branching programs for k-stable functions
Sauerhoff, M
STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 488 - 499
[44] Lower bounds for general graph-driven read-once parity branching programs
Brosenne, H
Homeister, M
Waack, S
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 290 - 299
[45] On the size of randomized OBDDs and read-once branching programs for k-stable functions
M. Sauerhoff
computational complexity, 2001, 10 : 155 - 178
[46] Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs
Mahajan, Meena
Rao, B. V. Raghavendra
Sreenivasaiah, Karteek
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 655 - 667
[47] On the size of randomized OBDDs and read-once branching programs for k-stable functions
Sauerhoff, M
COMPUTATIONAL COMPLEXITY, 2001, 10 (02) : 155 - 178
[48] PSEUDORANDOM PSEUDO-DISTRIBUTIONS WITH NEAR-OPTIMAL ERROR FOR READ-ONCE BRANCHING PROGRAMS
Braverman, Mark
Cohen, Gil
Garg, Sumegha
SIAM JOURNAL ON COMPUTING, 2020, 49 (05)
[49] On P versus NP∧co-NP for decision trees and read-once branching programs
Jukna, S
Razborov, A
Savicky, P
Wegener, I
COMPUTATIONAL COMPLEXITY, 1999, 8 (04) : 357 - 370
[50] A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
Sima, Jiri
Zak, Stanislav
FUNDAMENTA INFORMATICAE, 2021, 184 (04) : 307 - 354

← 1 2 3 4 5 →