Sciweavers

53 search results - page 2 / 11
» On the Size of Monotone Span Programs
Sort
View
COMBINATORICA
1999
53views more  COMBINATORICA 1999»
13 years 6 months ago
Superpolynomial Lower Bounds for Monotone Span Programs
László Babai, Anna Gál, Avi W...
JCM
2007
82views more  JCM 2007»
13 years 6 months ago
Secret Sharing Schemes With General Access Structure Based On MSPs
— In this paper we introduce two operations of access structure to build large monotone span programs MSPs from small MSPs. Furthermore, we point out a new method of constructing...
Jun Xu, Xiaomin Zha
CAV
2009
Springer
181views Hardware» more  CAV 2009»
14 years 6 months ago
Size-Change Termination, Monotonicity Constraints and Ranking Functions
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
Amir M. Ben-Amram
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
13 years 10 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
STACS
2009
Springer
14 years 1 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno