Simulating Probabilistic by Deterministic Algebraic Computation Trees
暂无分享,去创建一个
[1] Marc Snir,et al. Lower Bounds on Probabilistic Linear Decision Trees , 1985, Theor. Comput. Sci..
[2] Udi Manber,et al. Probabilistic, Nondeterministic, and Alternating Decision Trees , 1982, STOC 1982.
[3] Friedhelm Meyer auf der Heide,et al. Lower bounds for solving linear diophantine equations on random access machines , 1985, JACM.
[4] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..
[5] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[6] J. Milnor. Singular points of complex hypersurfaces , 1968 .
[7] DAVID DOBKIN,et al. A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem , 1978, J. Comput. Syst. Sci..
[8] Edward M. Reingold,et al. On the Optimality of Some Set Algorithms , 1972, JACM.
[9] John H. Reif. On Synchronous Parallel Computations with Independent Probabilistic Choice , 1984, SIAM J. Comput..
[10] Friedhelm Meyer auf der Heide. Fast algorithms for n-dimensional restrictions of hard problems , 1985, STOC '85.
[11] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.