Testing Computability by Width Two OBDDs

DOI10.1007/978-3-642-03685-9_51zbMath1255.68296OpenAlexW1496892516MaRDI QIDQ3638913

Gilad Tsur, Dana Ron

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_51

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Related Items (5)

Second-order finite automata ⋮ Lower Bounds for Testing Computability by Small Width OBDDs ⋮ Property testing lower bounds via communication complexity ⋮ Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity ⋮ Testing computability by width-two OBDDs

This page was built for publication: Testing Computability by Width Two OBDDs