搜索结果: 1-2 共查到“数理逻辑与数学基础 Lower bounds”相关记录2条 . 查询时间(0.015 秒)
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
Computational complexity Arithmetic circuits Determinant versus permanent Elementary symmetric polynomial
2012/12/3
The determinantal complexity of a polynomial f (x1, x2, . . . , xn) is the minimum m such that f = detm(L(x1, x2, . . . , xn)), where L(x1, x2, . . . , xn) is a matrix whose entries are affine forms i...
Lower Bounds for Additive Spanners, Emulators, and More
Lower Bounds for Additive Spanners Emulators
2012/11/29
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every k = O( ln n ln ln n), we c...