6120 search results - page 68 / 1224 » The Power of Linear Functions |
161
click to vote
ESANN
2004
15 years 6 months ago
2004
The one-dimensional functional equation g(y(t)) = cg(z(t)) with known functions y and z and constant c is considered. The indeterminacies are calculated, and an algorithm for appro...
130
click to vote
STOC
1990
ACM
15 years 9 months ago
1990
ACM
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...
117
Voted
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
139
click to vote
COCO
2001
Springer
15 years 9 months ago
2001
Springer
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
157
click to vote
ISSAC
1993
Springer
15 years 9 months ago
1993
Springer
Hypergeometric sequences are such that the quotient of two successive terms is a fixed rational function of the index. We give a generalization of M. Petkov6ek’s algorithm to fi...