Minimization Problems for Parity OBDDs
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2007/10/18
-
Journal
-
Indian UGC (journal)
-
Refrences18
-
Detlef Sieling
Cite
Sieling, Detlef. “Minimization Problems for Parity OBDDs”. Theory of Computing Systems, vol. 44, no. 3, 2007, pp. 391-13, https://doi.org/10.1007/s00224-007-9084-8.
Sieling, D. (2007). Minimization Problems for Parity OBDDs. Theory of Computing Systems, 44(3), 391-413. https://doi.org/10.1007/s00224-007-9084-8
Sieling, Detlef. “Minimization Problems for Parity OBDDs”. Theory of Computing Systems 44, no. 3 (2007): 391-413. https://doi.org/10.1007/s00224-007-9084-8.
Sieling D. Minimization Problems for Parity OBDDs. Theory of Computing Systems. 2007;44(3):391-413.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| The Nonapproximability of OBDD Minimization | Information and Computation |
| 12 | 2002 |
| 10.1016/S0166-218X(01)00324-9 | Discrete Applied Mathematics |
| 2002 | |
| On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams | Information and Computation |
| 3 | 2001 |
Some optimal inapproximability results | Journal of the ACM |
| 424 | 2001 |
A threshold of ln
n
for approximating set cover | Journal of the ACM |
| 959 | 1998 |