Name
Abstract | ||
|---|---|---|
In the paper we investigate Ordered Binary Decision Diagrams (OBDDs)–a model for computing Boolean functions. We present a series of results on the comparative complexity for several variants of OBDDmodels. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1134/S199508021606007X | DCFS |
Keywords | Field | DocType |
OBDD, quantum computation, nondeterminism, partial functions, width hierarchy | Boolean function,Quantum,Discrete mathematics,Combinatorics,Nondeterministic algorithm,Binary decision diagram,Quantum computer,Implicit function,Probabilistic logic,Mathematics,Partial function | Conference |
Volume | Issue | ISSN |
abs/1405.7849 | 6 | 1818-9962 |
Citations | PageRank | References |
11 | 0.57 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Farid M. Ablayev | 1 | 219 | 20.45 |
| Aida Gainutdinova | 2 | 59 | 4.95 |
| Kamil Khadiev | 3 | 26 | 7.92 |
| Abuzer Yakaryilmaz | 4 | 168 | 25.31 |