Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Span Programs
verfasst von : Stasys Jukna
Erschienen in: Boolean Function Complexity
Verlag: Springer Berlin Heidelberg
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
In 1993 Karchmer and Wigderson introduced an interesting linear algebraic model for computing boolean functions—the
span program
. A span program is just a matrix over some field with rows labeled by literals. (In this chapter we will only work over the field GF(2), but the results hold for any field.) 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, that is, negated variables are not allowed.