Testing computability by width-two OBDDs
type: Item
instance of: scholarly article
title: Testing computability by width-two OBDDs
zbMATH Open document ID: 1234.68462
author: Dana Ron
author: Gilad Tsur
published in: Theoretical Computer Science
publication date: 2012-03-13T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6014339
zbMATH Keywords: property testing
zbMATH Keywords: ordered binary decision diagram (OBDD)
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.11.007
OpenAlex ID: W2052134969
cites work: Testing Reed–Muller Codes
cites work: Property testing lower bounds via communication complexity
cites work: Self-testing/correcting with applications to numerical problems
cites work: Lower Bounds for Testing Computability by Small Width OBDDs
cites work: On learning width two branching programs
cites work: Q3152421
cites work: Testing juntas
cites work: On Testing Computability by Small Width OBDDs
cites work: Property testing and its connection to learning and approximation
cites work: Testing low-degree polynomials over prime fields
cites work: Testing problems with sublearning sample complexity
cites work: Communication Complexity
cites work: Query learning of bounded-width OBDDs
cites work: An efficient query learning algorithm for ordered binary decision diagrams
cites work: Testing Membership in Languages that Have Small Width Branching Programs
cites work: Testing Basic Boolean Formulae
cites work: On the distributional complexity of disjointness
cites work: lgorithmic and Analysis Techniques in Property Testing
cites work: Testing Computability by Width Two OBDDs
cites work: Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown
cites work: Robust Characterizations of Polynomials with Applications to Program Testing
DOI: 10.1016/J.TCS.2011.11.007
description: scientific article; zbMATH DE number 6014339