Journal of the ACM （JOLACM） - Issue 330 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 330 |
| 发布时间： |
| 卷期年份： 2022 |
| 卷期官网： |
本期论文列表
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes.
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring.
Enumeration for FO Queries over Nowhere Dense Graphs.
Counting Subgraphs in Degenerate Graphs.
The Limitations of Optimization from Samples.
Information Acquisition Under Resource Limitations in a Noisy Environment.