• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 15 matches

• 1972
• 
  Richard P. Brent:
  The Computational Complexity of Iterative Methods for Systems of Nonlinear Equations. Complexity of Computer Computations 1972: 61-71
• 
  Charles M. Fiduccia:
  On Obtaining Upper Bounds on the Complexity of Matrix Multiplication. Complexity of Computer Computations 1972: 31-40
• 
  Michael J. Fischer:
  Efficiency of Equivalence Algorithms. Complexity of Computer Computations 1972: 153-167
• 
  Robert W. Floyd:
  Permuting Information in Idealized Two-Level Storage. Complexity of Computer Computations 1972: 105-109
• 
  John E. Hopcroft, Robert Endre Tarjan:
  Isomorphism of Planar Graphs. Complexity of Computer Computations 1972: 131-152
• 
  Richard M. Karp:
  Reducibility Among Combinatorial Problems. Complexity of Computer Computations 1972: 85-103
• 
  Michael S. Paterson:
  Efficient Iterations for Algebraic Numbers. Complexity of Computer Computations 1972: 41-52
• 
  Vaughan R. Pratt:
  An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File. Complexity of Computer Computations 1972: 111-118
• 
  Michael O. Rabin:
  Solving Linear Equations by Means of Scalar Products. Complexity of Computer Computations 1972: 11-20
• 
  Edward M. Reingold, A. Ian Stocks:
  Simple Proofs of Lower Bounds for Polynomial Evaluation. Complexity of Computer Computations 1972: 21-30
• 
  Martin H. Schultz:
  The Computational Complexity of Elliptic Partial Differential Equations. Complexity of Computer Computations 1972: 73-83
• 
  Volker Strassen:
  Evaluation of Rational Functions. Complexity of Computer Computations 1972: 1-10
• 
  David C. van Voorhis:
  Toward a Lower Bound for Sorting Networks. Complexity of Computer Computations 1972: 119-129
• 
  Shmuel Winograd:
  Parallel Iteration Methods. Complexity of Computer Computations 1972: 53-60
• 
  Raymond E. Miller, James W. Thatcher:
  Proceedings of a symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA. The IBM Research Symposia Series, Plenum Press, New York 1972, ISBN 0-306-30707-3 [contents]