Hierarchy Theorems For kOBDDs AND kIBDDs (1998)
| Citations: | 9 - 7 self |
BibTeX
@MISC{Bollig98hierarchytheorems,
author = {Beate Bollig and Martin Sauerhoff and Detlef Sieling and Ingo Wegener},
title = {Hierarchy Theorems For kOBDDs AND kIBDDs},
year = {1998}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Almost the same types of restricted branching programs (or binary decision diagrams BDDs) are considered in complexity theory and in applications like hardware verification. These models are read-once branching programs (free BDDs) and certain types of oblivious branching programs (ordered and indexed BDDs with k layers). The complexity of the satisfiability problem for these restricted branching programs is investigated and tight hierarchy results are proved for the classes of functions representable by k layers of ordered or indexed BDDs of polynomial size. Keywords: branching programs, binary decision diagrams, communication complexity, hierarchies, lower bounds. Supported in part by DFG grant We 1066/7. 1 1. INTRODUCTION Branching programs are a well established computation model for discrete functions. Definition 1: A branching program G for a function f : A n ! B, where A = f0; : : : ; a \Gamma 1g and B = f0; : : : ; b \Gamma 1g is a directed acyclic graph with on...
