400 search results - page 31 / 80 » Lower Bounds Using Kolmogorov Complexity |
COMPGEOM
2000
ACM
14 years 2 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
ITA
2000
13 years 9 months ago
2000
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
IJCNN
2000
IEEE
14 years 2 months ago
2000
IEEE
A product unit is a formal neuron that multiplies its input values instead of summingthem. Furthermore, it has weights acting as exponents instead of being factors. We investigate...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...