Journal of the ACM （JOLACM） - Issue 205 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 205 |
| 发布时间： |
| 卷期年份： 2001 |
| 卷期官网： |
本期论文列表
Some optimal inapproximability results.
Efficient generation of shared RSA keys.
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
An efficient algorithm for image segmentation, Markov random fields and related problems.
Decomposable negation normal form.
Logics with aggregate operators.
Quantum lower bounds by polynomials.
Plausibility measures and default reasoning.
Extractors and pseudorandom generators.
A combinatorial strongly polynomial algorithm for minimizing submodular functions.