搜索结果: 1-4 共查到“数学基础 Complexity”相关记录4条 . 查询时间(0.14 秒)
The Streaming Complexity of Cycle Counting, Sorting By Reversals, and Other Problems
Streaming Complexity Cycle Counting,
2012/12/3
In this paper we introduce a new technique for proving streaming lower bounds (and one-way communication lower bounds), by reductions from a problem called the Boolean Hidden Hypermatching problem (BH...
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...
The Approximation Complexity of Win-Lose Games
The Approximation Complexity Win-Lose Games
2012/11/29
We further our algorithmic and structural understanding of Nash equilibria.
Computing Nash Equilibria: Approximation and Smoothed Complexity
Computing Nash Equilibria Approximation Smoothed Complexity
2012/11/29
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria and in the smoothed anal...