Journal of the ACM （JOLACM） - Issue 321 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 321 |
| 发布时间： |
| 卷期年份： 2020 |
| 卷期官网： |
本期论文列表
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes.
Invited Articles Foreword.
Semantic Optimization of Conjunctive Queries.
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem.
Polynomiality for Bin Packing with a Constant Number of Item Types.
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time.
A Unified Translation of Linear Temporal Logic to ω-Automata.