TY - GEN
T1 - On Span Programs
AU - Karchmer, M.
AU - Wigderson, A.
PY - 1993
Y1 - 1993
N2 - We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexity and cryptography: SL is contained in ⊕L (a weak Logspace analogue of NP is contained in ⊕P), the first superlinear size lower bounds on branching programs that count, and a broader class of functions which possess information-theoretic secret sharing schemes. The proof of the main connection, between Span Programs and counting branching programs, uses a variant of Razborov's general approximation method.
AB - We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexity and cryptography: SL is contained in ⊕L (a weak Logspace analogue of NP is contained in ⊕P), the first superlinear size lower bounds on branching programs that count, and a broader class of functions which possess information-theoretic secret sharing schemes. The proof of the main connection, between Span Programs and counting branching programs, uses a variant of Razborov's general approximation method.
UR - http://www.scopus.com/inward/record.url?scp=0027154548&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0027154548
SN - 0818640715
T3 - Proceedings of the Eighth Annual Structure in Complexity Theory Conference
SP - 102
EP - 111
BT - Proceedings of the Eighth Annual Structure in Complexity Theory Conference
A2 - Anon, null
PB - Publ by IEEE
T2 - Proceedings of the Eighth Annual Structure in Complexity Theory Conference
Y2 - 18 May 1993 through 21 May 1993
ER -