Journal of the ACM （JOLACM） - Issue 278 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 278 |
| 发布时间： |
| 卷期年份： 2013 |
| 卷期官网： |
本期论文列表
From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits.
Invited article foreword.
Testing first-order properties for subclasses of sparse graphs.
Fast matrix rank algorithms and applications.
Random graphs and the parity quantifier.
The expressibility of functions on the boolean domain, with applications to counting CSPs.
Towards a complexity theory for local distributed computing.
The complexity of the counting constraint satisfaction problem.
Lower bounds for local approximation.
Editorial: JACM redux.