Journal of the ACM（JOLACM ）的ISSUE 205论文列表

卷期号： 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.