Journal of the ACM （JOLACM） - Issue 222 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 222 |
| 发布时间： |
| 卷期年份： 2004 |
| 卷期官网： |
本期论文列表
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time.
On clusterings: Good, bad and spectral.
Satisfiability of word equations with constants is in PSPACE.
Polynomial-time data reduction for dominating set.
Lower bounds on the bounded coefficient complexity of bilinear maps.