Showing papers by "Christian Szegedy published in 2006"
TL;DR: This work considers boolean circuits C over the basis @W={@?,@?} with inputs x"1, x"2,...,x"n for which arrival times t" 1,t"2...,t"[email protected]?N"0 are given.
19 citations
TL;DR: It is proved that a matroid representable over a field of characteristic 2 admits an odd ear-decomposition if and only if it can be represented by some space on which the induced scalar product is a non-degenerate symplectic form.
Abstract: Matroids admitting an odd ear-decomposition can be viewed as natural generalizations of factor-critical graphs. We prove that a matroid representable over a field of characteristic 2 admits an odd ear-decomposition if and only if it can be represented by some space on which the induced scalar product is a non-degenerate symplectic form. We also show that, for a matroid representable over a field of characteristic 2, the independent sets whose contraction admits an odd ear-decomposition form the family of feasible sets of a representable Δ-matroid.
7 citations