SIAM Journal on Computing, Volume 21, Issues 1-3Society for Industrial and Applied Mathematics, 1992 - Electronic data processing |
Contents
Volume 21 Number | 1 |
On the Average Size of the Intersection of Binary Trees | 24 |
Polynomial Threshold Functions ACº Functions and Spectral Norms | 33 |
Copyright | |
34 other sections not shown
Other editions - View all
Common terms and phrases
accepted algorithm analysis apply assume begin bound boundaries called column comparisons complete Computer consider consists constant construction contains corresponding data structure defined definition denote described determine dimension distribution edges efficient elements equivalent example exists extended face fact Finally finite function give given graph Hence independent input intersection iteration learning least Lemma linear lower bound matching method node notch Note O(log observe obtain operations optimal parallel partition path pattern performed planar plane polynomial positions present probability problem processors Proof prove query random reduced represent respectively result roots running sampling satisfies Science segments sequence SIAM solution space steps strategy string structure takes task Theorem tile tree University vector vertex vertices