A reducibility concept for problems defined in terms of ordered binary decision diagrams

DOI10.1007/BFb0023461zbMath1498.68117OpenAlexW1721020739MaRDI QIDQ5047173

Anna Slobodová, Christoph Meinel

Publication date: 9 November 2022

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

Full work available at URL: https://doi.org/10.1007/bfb0023461

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Uses Software

• CUDD

Cites Work

• Modified branching programs and their computational power
• Reduction of OBDDs in linear time
• Read-once projections and formal circuit verification with binary decision diagrams
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A reducibility concept for problems defined in terms of ordered binary decision diagrams