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

DOI10.1007/BF02679459zbMath0876.68044OpenAlexW2110552792MaRDI QIDQ1364133

Christoph Meinel, Anna Slobodová

Publication date: 24 August 1997

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

reducibility

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Some properties of space-bounded synchronized alternating Turing machines with universal states only

Uses Software

• CUDD

Cites Work

• Reduction of OBDDs in linear time
• Graph-Based Algorithms for Boolean Function Manipulation
• A complexity theory based on Boolean algebra
• Read-once projections and formal circuit verification with binary decision diagrams
• 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