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

Research output: Contribution to journal › Conference article › peer-review

Original language	English
Pages (from-to)	73-79
Number of pages	7
Journal	Proceedings of the Annual IEEE Conference on Computational Complexity
State	Published - 2002
Externally published	Yes
Event	17th Annual IEEE Conference on Computational Complexity - Montreal, Canada Duration: 21 May 2002 → 24 May 2002

ASJC Scopus subject areas

@article{fb19ae32c11f4c558396550edc23079b,

title = "Functions that have read-twice constant width branching programs are not necessarily testable",

author = "Eldar Fischer and Ilan Newman",

year = "2002",

language = "English",

pages = "73--79",

journal = "Proceedings of the Annual IEEE Conference on Computational Complexity",

issn = "1093-0159",

publisher = "IEEE Computer Society",

note = "17th Annual IEEE Conference on Computational Complexity ; Conference date: 21-05-2002 Through 24-05-2002",

}

TY - JOUR

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

AU - Fischer, Eldar

AU - Newman, Ilan

PY - 2002

Y1 - 2002

UR - http://www.scopus.com/inward/record.url?scp=0036287476&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0036287476

SN - 1093-0159

SP - 73

EP - 79

JO - Proceedings of the Annual IEEE Conference on Computational Complexity

JF - Proceedings of the Annual IEEE Conference on Computational Complexity

T2 - 17th Annual IEEE Conference on Computational Complexity

Y2 - 21 May 2002 through 24 May 2002

ER -