Span Programs

  • Stasys Jukna
Part of the Texts in Theoretical Computer Science. An EATCS Series book series (TTCS)


In 1993 Karchmer and Wigderson introduced an interesting linear algebraic model for computing boolean functions — the span program. A span program for a function f(x 1, ..., x n ) is presented as a matrix over some field, with rows labeled by variables x i or their negations i (one variable can label many rows) . The span program accepts an input assignment if and only if the all-1 vector can be obtained as a linear combination of the rows whose labels are satisfied by the input. The size of the span program is the number of rows in the matrix. A span program is monotone if only positive literals are used as labels of the rows, i.e. negated variables are not allowed.


Bipartite Graph Boolean Function Complete Bipartite Graph Switching Network Monotone Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Stasys Jukna
    • 1
    • 2
  1. 1.Informatik - FB 20, Theoretische InformatikJohann Wolfgang Goethe-UniversitätFrankfurtGermany
  2. 2.Institute of Mathematics and InformaticsVilniusLethuania

Personalised recommendations