L. Babai, A. Gal, J. Kollar, L. Ronyai, T. Szabo, A. Wigderson: Extremal bipartite graphs and super-polynomial lower bounds for monotone span programs, Proc. ACM STOC '96, pp. 603--611. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
General Secure Multi-Party Computation from any Linear .. - Cramer.. (1999) (32 citations) (Correct)
.... z) f(x, y) # (z # (# n i=1 x i ) The claims on the properties of f, g follow from a theorem on the composition of MSP s (see [30] the well known fact that threshold functions have linear MSP complexity and that a function and its dual have the same MSP complexity (see e.g. 21] In [1], the monotone function ODDFACTOR is studied. This function is defined on bipartite graphs on t = # n pairs of vertices, where an input graph can be specified by n Boolean variables, one for each of the potential edges. An input graph is accepted if and only it contains an odd factor, i.e. a ....
....pairs of vertices, where an input graph can be specified by n Boolean variables, one for each of the potential edges. An input graph is accepted if and only it contains an odd factor, i.e. a subgraph in which every vertex has odd degree (in particular degree 0) The following result is proved in [1]: Theorem 9 The ODDFACTOR function on n variables can be computed by an MSP over GF (2) of size n, but a monotone Boolean circuit computing the function must have size n# (log n) Now suppose we are given a monotone Boolean circuit family that for any n computes ODDFACTOR on input graphs ....
L. Babai, A. Gal, J. Kollar, L. Ronyai, T. Szabo, A. Wigderson: Extremal bipartite graphs and super-polynomial lower bounds for monotone span programs, Proc. ACM STOC '96, pp. 603--611.
A Characterization of Span Program Size and Improved Lower Bounds.. - Gál (1998) (7 citations) Self-citation (G'al) (Correct)
No context found.
L. Babai, A. G'al, J. Koll'ar, L. R'onyai, T. Szab'o, A. Wigderson: Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. In Proc. 28th ACM STOC, 1996, pp. 603--611.
General Secure Multi-Party Computation from any Linear .. - Cramer.. (2000) (32 citations) (Correct)
No context found.
L. Babai, A. Gal, J. Kollar, L. Ronyai, T. Szabo, A. Wigderson: Extremal bipartite graphs and super-polynomial lower bounds for monotone span programs, Proc. ACM STOC '96, pp. 603--611.
Span Programs and General Secure Multi-Party Computation - Cramer, Damgård, Maurer (1997) (3 citations) (Correct)
No context found.
L. Babai, A. G'al, J. Koll'ar, L. R'onyai, T. Szab'o, A. Wigderson: Extremal Bipartite Graphs and Superpolynomial Lowerbounds for Monotone Span Programs, Proc. ACM STOC '96, pp. 603--611.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC