On the complexity of computations under varying sets of primitives

  • David P. Dobkin
  • Richard J. Lipton
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)


  1. [1]
    Blum, Floyd, Pratt, Rivest, Tarjan. Linear time bounds for selection. JCSS 7:448–461, 1973.zbMATHGoogle Scholar
  2. [2]
    Dobkin, Lipton. On some generalizations of binary search. ACM Symposium on the Theory of Computing, Seattle, Washington, May 1974.Google Scholar
  3. [3]
    Fischer, Meyer, Paterson. Lower bounds on the size of Boolean formulas. ACM Symposium on the Theory of Computing, Albuquerque, New Mexico, May 1975.Google Scholar
  4. [4]
    Grünbaum. Convex Polytopes. Interscience Publishers, 1967.Google Scholar
  5. [5]
    Harper, Savage. On the complexity of the marriage problem. Advances in Mathematics 9:299–312, 1972.MathSciNetCrossRefGoogle Scholar
  6. [6]
    Kerr. The effect of algebraic structure on the computational complexity of matrix multiplication. PhD thesis, Cornell University, Ithaca, New York, 1970.Google Scholar
  7. [7]
    Lefschetz. Algebraic Geometry. Princeton University Press, 1953.Google Scholar
  8. [8]
    Schnorr. A lower bound on the number of additions in monotone computations of monotone rational polynomials. Unpublished manuscript.Google Scholar
  9. [9]
    Schönhage, Strassen. Fast multiplication of large numbers (in German). Computing 1:182–196, 1966.MathSciNetCrossRefGoogle Scholar
  10. [10]
    Spira. On the number of comparisons necessary to rank an element. Computational Complexity Symposium, Courant Institute, 1973.Google Scholar
  11. [11]
    Strassen. Gaussian elimination is not optimal. Numerische Mathematik 13:354–6, 1969.MathSciNetCrossRefGoogle Scholar
  12. [12]
    Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1, 1972.Google Scholar
  13. [13]
    Vilfan. The complexity of finite functions. Technical Report 97, Project MAC, MIT, 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • David P. Dobkin
    • 1
  • Richard J. Lipton
    • 1
  1. 1.Department of Computer ScienceYale UniversityNew HavenUSA

Personalised recommendations