Anzeige
Erschienen in:
1995 | ReviewPaper | Buchkapitel
New lower bounds and hierarchy results for restricted branching programs
verfasst von : Detlef Sieling, Ingo Wegener
Erschienen in: Graph-Theoretic Concepts in Computer Science
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Known lower bound techniques for depth restricted branching programs are not sensitive enough to lead to tight hierarchies. A new lower bound technique implies the separation of the classes of polynomial-size branching programs, where on each path k variables may be tested more than once and k≤(1−ε)(n/3)1/3/ log2/3n for some ε>0. Methods from communication complexity theory are adopted to separate the classes of polynomial-size ordered read k times branching programs, where k=o(n1/2/ log2n).