Testing computability by width-2 OBDDs where the variable order is unknown

DOI10.1007/978-3-642-13073-1_13MaRDI QIDQ3562998zbMATH OpenOpenAlexFDO

Authors Dana Ron, Gilad Tsur

Publication date 28 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13073-1_13

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Recommendations

• Testing computability by width-two OBDDs
• Testing Computability by Width Two OBDDs
• Lower Bounds for Testing Computability by Small Width OBDDs
• On testing computability by small width OBDDs
• On the Width of Ordered Binary Decision Diagrams

Cited in

(4)

• Lower Bounds for Testing Computability by Small Width OBDDs
• On testing computability by small width OBDDs
• Testing Computability by Width Two OBDDs
• Testing computability by width-two OBDDs

This page was built for publication: Testing computability by width-2 OBDDs where the variable order is unknown

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562998)