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

DOI10.1002/rsa.10110zbMath1095.68031OpenAlexW2118212166MaRDI QIDQ4459589

Jiří Sgall, Ilan Newman, Eldar Fischer

Publication date: 29 March 2004

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10110

Mathematics Subject Classification ID

Related Items (2)

Testing of matrix-poset properties ⋮ A large lower bound on the query complexity of a simple Boolean function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Functions that have read‐twice constant width branching programs are not necessarily testable