Span Programs | ScienceGate

Lower bounds for monotone span programs

Proceedings of IEEE 36th Annual Foundations of Computer Science ◽

10.1109/sfcs.1995.492669 ◽

1995 ◽

Cited By ~ 8

Author(s):

A. Beimel ◽

A. Gal ◽

M. Paterson

Keyword(s):

Lower Bounds ◽

Monotone Span Programs ◽

Span Programs

On the Size of Monotone Span Programs

Security in Communication Networks - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30598-9_18 ◽

2005 ◽

pp. 249-262 ◽

Cited By ~ 6

Author(s):

Ventzislav Nikov ◽

Svetla Nikova ◽

Bart Preneel

Keyword(s):

Monotone Span Programs ◽

Span Programs

On span programs

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336536 ◽

2002 ◽

Cited By ~ 132

Author(s):

M. Karchmer ◽

A. Wigderson

Keyword(s):

Span Programs

Exponential Lower Bounds for Monotone Span Programs

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.51 ◽

2016 ◽

Cited By ~ 16

Author(s):

Robert Robere ◽

Toniann Pitassi ◽

Benjamin Rossman ◽

Stephen A. Cook

Keyword(s):

Lower Bounds ◽

Monotone Span Programs ◽

Span Programs

Square Span Programs with Applications to Succinct NIZK Arguments

Lecture Notes in Computer Science - Advances in Cryptology – ASIACRYPT 2014 ◽

10.1007/978-3-662-45611-8_28 ◽

2014 ◽

pp. 532-550 ◽

Cited By ~ 39

Author(s):

George Danezis ◽

Cédric Fournet ◽

Jens Groth ◽

Markulf Kohlweiss

Keyword(s):

Span Programs

Lower Bounds for Monotone Span Programs

BRICS Report Series ◽

10.7146/brics.v1i46.21596 ◽

1994 ◽

Vol 1 (46) ◽

Cited By ~ 1

Author(s):

Amos Beimel

Keyword(s):

Lower Bounds ◽

Secret Sharing ◽

Algebraic Model ◽

New Technique ◽

Secret Sharing Schemes ◽

Branching Programs ◽

Model Of Computation ◽

Monotone Span Programs ◽

Span Programs ◽

A New Technique

The model of span programs is a linear algebraic model of computation. Lower bounds for span programs imply lower bounds for contact schemes, symmetric branching programs and for formula size. Monotone span programs correspond also to linear secret-sharing schemes. We present a new technique for proving lower bounds for monotone span programs. The main result proved here yields quadratic lower bounds for the size of monotone span programs, improving on the largest previously known bounds for explicit functions. The bound is asymptotically tight for the function corresponding to a class of 4-cliques.

A characterization of span program size and improved lower bounds for monotone span programs

Computational Complexity ◽

10.1007/s000370100001 ◽

2001 ◽

Vol 10 (4) ◽

pp. 277-296 ◽

Cited By ~ 23

Author(s):

Ana G�l

Keyword(s):

Lower Bounds ◽

Monotone Span Programs ◽

Span Programs

Span Programs are Equivalent to Quantum Query Algorithms

SIAM Journal on Computing ◽

10.1137/100792640 ◽

2014 ◽

Vol 43 (3) ◽

pp. 1206-1219 ◽

Cited By ~ 1

Author(s):

Ben W. Reichardt

Keyword(s):

Span Programs ◽

Quantum Query ◽

Query Algorithms

Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.238010 ◽

1996 ◽

Cited By ~ 9

Author(s):

László Babai ◽

Anna Gál ◽

János Kollár ◽

Lajos Rónyai ◽

Tibor Szabó ◽

...

Keyword(s):

Lower Bounds ◽

Bipartite Graphs ◽

Monotone Span Programs ◽

Span Programs

Separating the Power of Monotone Span Programs over Different Fields

SIAM Journal on Computing ◽

10.1137/s0097539704444038 ◽

2005 ◽

Vol 34 (5) ◽

pp. 1196-1215 ◽

Cited By ~ 15

Author(s):

Amos Beimel ◽

Enav Weinreb

Keyword(s):

Monotone Span Programs ◽

Span Programs