Linear codes are hard for oblivious read-once parity branching programs

被引：0
|
作者：
Department of Computer Science, University of Trier, D-54286 Trier, Germany [1 ]
不详 [2 ]
机构：
来源：
Inf. Process. Lett. | / 6卷 / 267-269期
关键词：
Number:; Me; 1077110-l; Acronym:; DFG; Sponsor: Deutsche Forschungsgemeinschaft;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Linear codes are hard for oblivious read-once parity branching programs
    Jukna, S
    INFORMATION PROCESSING LETTERS, 1999, 69 (06) : 267 - 269
  • [2] Lower bounds for restricted read-once parity branching programs
    Homeister, Matthias
    THEORETICAL COMPUTER SCIENCE, 2006, 359 (1-3) : 1 - 14
  • [3] Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs
    Gurjar, Rohit
    Korwar, Arpita
    Saxena, Nitin
    Thierauf, Thomas
    30TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2015), 2015, 33 : 323 - 346
  • [4] Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
    Rohit Gurjar
    Arpita Korwar
    Nitin Saxena
    Thomas Thierauf
    computational complexity, 2017, 26 : 835 - 880
  • [5] Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
    Gurjar, Rohit
    Korwar, Arpita
    Saxena, Nitin
    Thierauf, Thomas
    COMPUTATIONAL COMPLEXITY, 2017, 26 (04) : 835 - 880
  • [6] A hierarchy result for read-once branching programs with restricted parity nondeterminism
    Savicky, P
    Sieling, D
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (03) : 594 - 605
  • [7] 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
  • [8] On Tseitin Formulas, Read-Once Branching Programs and Treewidth
    Glinskih, Ludmila
    Itsykson, Dmitry
    THEORY OF COMPUTING SYSTEMS, 2021, 65 (03) : 613 - 633
  • [9] On Tseitin Formulas, Read-Once Branching Programs and Treewidth
    Glinskih, Ludmila
    Itsykson, Dmitry
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2019, 11532 : 143 - 155
  • [10] Read-Once Branching Programs for Tree Evaluation Problems
    Iwama, Kazuo
    Nagao, Atsuki
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2019, 11 (01)
12345