论文信息 - On the Complexity of Computations under Varying Sets of Primitives - 字舞流文

On the Complexity of Computations under Varying Sets of Primitives

Richard J. Lipton | David P. Dobkin | R. Lipton | D. Dobkin

[1] DAVID DOBKIN,et al. A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem , 1978, J. Comput. Syst. Sci..

[2] L. R. Kerr. The Effect of Algebraic Structure on the Computational Complexity of Matrix Multiplication , 1970 .

[3] L. H. Harper,et al. On the complexity of the marriage problem , 1972 .

[4] Michael J. Fischer,et al. Lower bounds on the size of Boolean formulas: Preliminary Report , 1975, STOC '75.

[5] G. C. Shephard,et al. Convex Polytopes , 1967 .

[6] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[7] Edward M. Reingold,et al. Computing the Maximum and the Median , 1971, SWAT.

[8] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[9] T. Willmore. Algebraic Geometry , 1973, Nature.

[10] Michael O. Rabin,et al. Proving Simultaneous Positivity of Linear Forms , 1972, J. Comput. Syst. Sci..

[11] David P. Dobkin. A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems , 1976, J. Comput. Syst. Sci..

[12] V. Strassen. Gaussian elimination is not optimal , 1969 .

[13] R. Lipton,et al. On some generalizations of binary search , 1974, STOC '74.

[14] Claus-Peter Schnorr,et al. A Lower Bound on the Number of Additions in Monotone Computations , 1976, Theor. Comput. Sci..