-
2
-
-
84963649861
-
-
Proc. 9th Ann. ACM Symp. on Theory of Computing, Boulder, Colo
-
Adleman, L, and Manders, K. Reducibility, randomness, and intractability. Proc. 9th Ann. ACM Symp. on Theory of Computing, Boulder, Colo, 1977, pp. 151-163.
-
(1977)
Reducibility, randomness, and intractability.
, pp. 151-163
-
-
Adleman, L.1
Manders, K.2
-
4
-
-
0002962651
-
-
Inf Proc, Lett JO
-
Blum, M, Chandra, A, and Weoman, M. Equivalence of free Boolean graphs can be decided probabilistically in polynomial time. Inf Proc, Lett JO (1980), 80-82.
-
(1980)
Equivalence of free Boolean graphs can be decided probabilistically in polynomial time.
, pp. 80-82
-
-
Blum, M.1
Chandra, A.2
Weoman, M.3
-
5
-
-
85059770931
-
-
ACM Symp. on Theory of Computing, Shaker Heights, Ohio
-
Cook, S The complexity of theorem-proving procedures Proc. 3rd Ann, ACM Symp. on Theory of Computing, Shaker Heights, Ohio, 1971, pp 151-158.
-
(1971)
The complexity of theorem-proving procedures Proc. 3rd Ann
, pp. 151-158
-
-
Cook, S.1
-
8
-
-
0003620778
-
-
Languages and Computation. Addison-Wesley, Reading, Mass.
-
Hopcroft, J, and Ullman, J.D., Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.
-
(1979)
Introduction to Automata Theory
-
-
Hopcroft, J.1
Ullman, J.D.2
-
9
-
-
85031942097
-
-
Proc. 10th Ann. ACM Symp. on Theory of Computing, San Diego, Calif
-
Hyafil, L. On the parallel evaluation of multivariate polynomials. Proc. 10th Ann. ACM Symp. on Theory of Computing, San Diego, Calif,, 1978, pp. 193-195.
-
(1978)
On the parallel evaluation of multivariate polynomials.
, pp. 193-195
-
-
Hyafil, L.1
-
10
-
-
84976780658
-
-
On the simplification and equivalence problems for straight-line programs To appear in J. ACM (available as Tech. Rep. 79-21, Computer Science Dep., Univ. of Minnesota, Minneapolis, Minn.
-
Ibarra, O, akd Letninger, B. On the simplification and equivalence problems for straight-line programs To appear in J. ACM (available as Tech. Rep. 79-21, Computer Science Dep., Univ. of Minnesota, Minneapolis, Minn., 1979).
-
(1979)
-
-
Ibarra, O.1
akd Letninger, B.2
-
11
-
-
0019625689
-
-
Inf. Proc. Lett.
-
Idarra, O., Rosim., L, and Moran, S. Probabilistic algorithms and stratght-line programs for some rank decision problems. Inf. Proc. Lett. 12 (1981), 227-232.
-
(1981)
Probabilistic algorithms and stratght-line programs for some rank decision problems.
, vol.12
, pp. 227-232
-
-
Idarra, O.1
Rosim, L.2
Moran, S.3
-
12
-
-
0003657590
-
-
Seminumericat Algorithms. Addison-Wesley, Reading, Mass.
-
Knuth, D. The Art of Computer Programming, Vol. 2. Seminumericat Algorithms. Addison-Wesley, Reading, Mass., 1969.
-
(1969)
The Art of Computer Programming
, vol.2
-
-
Knuth, D.1
-
13
-
-
84946836892
-
-
Proc. 5th Ann. ACM Symp. on Theory of Computing, Austin, Texas
-
Meyer, A,, and Stockmeyer, L. Word problems requiring exponential tune. Proc. 5th Ann. ACM Symp. on Theory of Computing, Austin, Texas, 1973, pp 1-9.
-
(1973)
Word problems requiring exponential tune.
, pp. 1-9
-
-
Meyer, A.1
Stockmeyer, L.2
-
14
-
-
0038241207
-
-
Ph D. Dissertation, Univ. of California, Berkeley, Calif
-
Miller, G. Riemann&s hypothesis and tests of primahty, Ph D. Dissertation, Univ. of California, Berkeley, Calif, 1975.
-
(1975)
Riemann&s hypothesis and tests of primahty
-
-
Miller, G.1
-
15
-
-
84976665368
-
-
On the accepting density hierarchy in NP (submitted for publication) A more complete version is available as Tech. Rep. 79-29, Computer Science Dep., Univ. of Minnesota, Minneapolis, Minn
-
Moran, S. On the accepting density hierarchy in NP (submitted for publication) A more complete version is available as Tech. Rep. 79-29, Computer Science Dep., Univ. of Minnesota, Minneapolis, Minn, 1979.
-
(1979)
-
-
Moran, S.1
-
17
-
-
85034715651
-
-
Proc. 11th Ann ACM Symp on Theory of Computing, Atlanta, Ga.
-
Valiant, L. Completeness classes m algebra. Proc. 11th Ann ACM Symp on Theory of Computing, Atlanta, Ga., 1979, pp. 249-261
-
(1979)
Completeness classes m algebra.
, pp. 249-261
-
-
Valiant, L.1
-
18
-
-
85040154387
-
-
Proc. 20th Ann. IEEE Symp on Foundations of Computer Science, San Juan, Puerto Rico
-
Yemini, Y. Some theoretical aspects of position-location problems. Proc. 20th Ann. IEEE Symp on Foundations of Computer Science, San Juan, Puerto Rico, 1979, pp. 1-8.
-
(1979)
Some theoretical aspects of position-location problems.
, pp. 1-8
-
-
Yemini, Y.1
|