文章基本信息

标题：Lower Bounds for Monotone Span Programs
本地全文：下载
作者：Amos Beimel
期刊名称：BRICS Report Series
印刷版ISSN：0909-0878
出版年度：1994
卷号：1
期号：46
出版社：Aarhus University
摘要：The model of span programs is a linear algebraic model of computation. Lower bounds for span programs imply lower bounds for contact schemes, symmetric branching programs and for formula size. Monotone span programs correspond also to linear secret-sharing schemes. We present a new technique for proving lower bounds for monotone span programs. The main result proved here yields quadratic lower bounds for the size of monotone span programs, improving on the largest previously known bounds for explicit functions. The bound is asymptotically tight for the function corresponding to a class of 4-cliques.