论文信息 - Some Observations on the Probabilistic Algorithms and NP-hard Problems - 字舞流文

Some Observations on the Probabilistic Algorithms and NP-hard Problems

Ker-I Ko | K. Ko

[1] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[2] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[3] C. Rackoff. Relativized questions involving probabilistic algorithms , 1978, STOC 1978.

[4] Leonard M. Adleman,et al. Reducibility, randomness, and intractibility (Abstract) , 1977, STOC '77.

[5] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[6] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[7] Vaughan R. Pratt,et al. Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[8] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.

[9] John T. Gill,et al. Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[10] Janos Simon. On some central problems in computational complexity , 1975 .