Sciweavers

1132 search results - page 131 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
SCN
2004
Springer
102views Communications» more  SCN 2004»
15 years 11 months ago
On the Size of Monotone Span Programs
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
STACS
1994
Springer
15 years 10 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
CCCG
2004
15 years 7 months ago
On the number of line tangents to four triangles in three-dimensional space
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
Hervé Brönnimann, Olivier Devillers, S...
CORR
2007
Springer
136views Education» more  CORR 2007»
15 years 6 months ago
On Cognitive Interference Networks
— We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each...
Amos Lapidoth, Shlomo Shamai, Michele A. Wigger
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 6 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh