Functions that have read-twice constant width branching programs are not necessarily testable

被引：6

作者：

Fischer, E ^{[1
]}

Newman, I ^{[1
]}

机构：

[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel

来源：

17TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/CCC.2002.1004342

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We construct a property on 0/1-strings that has a representation by a collection of width 3, read-twice oblivious branching programs, but for which any 2-sided C-testing algorithm must make at least Omega(n(1/10)) many queries for some fixed small enough epsilon. This shows that Newmann's result [15] cannot be generalized to read-k-times functions for k > 1.

引用

页码：73 / 79

页数：7

共 17 条

[1] Functions that have read-twice constant width branching programs are not necessarily testable
Fischer, E
Newman, I
Sgall, J
RANDOM STRUCTURES & ALGORITHMS, 2004, 24 (02) : 175 - 193
[2] Functions that have read-once branching programs of quadratic size are not necessarily testable
Bollig, B
Wegener, I
INFORMATION PROCESSING LETTERS, 2003, 87 (01) : 25 - 29
[3] An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability
Seto, Kazuhisa
Teruyama, Junichi
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (06) : 1019 - 1024
[4] Testing of function that have small width branching programs
Newman, I
41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 251 - 258
[5] Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
Gurjar, Rohit
Korwar, Arpita
Saxena, Nitin
THEORY OF COMPUTING, 2017, 13 : 1 - 21
[6] Testing membership in languages that have small width branching programs
Newman, I
SIAM JOURNAL ON COMPUTING, 2002, 31 (05) : 1557 - 1570
[7] 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
[8] Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
Jansen, Maurice
Rao, Raghavendra B., V
COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2009, 5675 : 179 - +
[9] On the nonapproximability of Boolean functions by OBDDs and read-k-times branching programs
Bollig, B
Sauerhoff, M
Wegener, I
INFORMATION AND COMPUTATION, 2002, 178 (01) : 263 - 278
[10] Constant width planar branching programs characterize ACC0 in quasipolynomial size
Hansen, Kristoffer Arnsfelt
TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 92 - 99

← 1 2 →