Abstract
Reducibility concepts are fundamental in complexity theory. Usually, they are defined as follows: A problem Π is reducible to a problem Σ if Π can be computed using a program or device for Σ as a subroutine. However, this approach has its limitations if restricted computational models are considered. In the case of ordered binary decision diagrams (OBDDs), it allows merely to use the almost unmodified original program for the subroutine.
Here we propose a new reducibility concept for OBDDs: We say that Π is reducible to Σ if an OBDD for Π can be constructed by applying a sequence of elementary operations to an OBDD for Σ. In contrast to previous reducibility notions, the suggested one is able to reflect the real needs of a reducibility concept in the context of OBDD-based complexity classes: it allows to reduce those problems to each other which are computable with the same amount of OBDD-resources and it gives a tool to carrying over lower and upper bounds.
We are grateful to DAAD ACCIONES INTEGRADAS, grant Nr. 322-ai-e-dr
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. S. Brace, R. L. Rudell, R. E. Bryant: Efficient Implementation of a BDD Package, Proc. of 27th ACM/IEEE Design Automation Conference, 1990, 40–45.
R. E. Bryant: Symbolic Boolean Manipulation With Ordered Binary Decision Diagrams. ACM Computing Surves, 24 (3), p. 293–218, 1992.
R. E. Bryant: Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification. Proc. ICCAD'95.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill: Symbolic Model Checking: 1020 states and beyond, Proc. of 5th IEEE Symposium on Logic in Computer Science, 46–51, 1990.
B. Bollig, I. Wegener: Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. Proc. STACS'96 (1996), 491–502.
J. L. Balcázar, J. Díaz, J. Gabarró: Structural Complexity I., Springer 1988.
J. van Leeuwen: Handbook of Theoretical Computer Sci. MIT Press, 1990.
K. Kriegel, S. Waack: Exponential Lower Bounds for Real-time Branching Programs. Proc. FCT'87, LNCS 278 (1987), 263–367.
M. Krause, Ch. Meinel, S. Waack: Separating the Eraser Turing Machine Classes L ∈, NL ∈, co and P ∈. Proc. MFCS'88, LNCS 324 (1988), 405–413.
D. Long: BDD-Package, CMU.
Ch. Meinel: Modified Branching Programs and Their Computational Power. LNCS 370, Springer Verlag, 1989.
F. Somenzi: CUDD: CU Decision Diagram Package (Release 1.1.1). University of Colorado at Boulder. June 1996.
D. Sieling, I. Wegener: Reduction of BDDs in linear time. Information Processing Letters 48 (1993) 139–144.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meinel, C., Slobodová, A. (1997). A reducibility concept for problems defined in terms of ordered binary decision diagrams. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023461
Download citation
DOI: https://doi.org/10.1007/BFb0023461
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive