• 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 17 matches

• 1992
• 
  Franz Aurenhammer, Johann Hagauer, Wilfried Imrich:
  Cartesian Graph Factorization at Logarithmic Cost per Edge. Comput. Complex. 2: 331-349 (1992)
• 
  László Babai, Lance Fortnow, Carsten Lund:
  Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Comput. Complex. 2: 374 (1992)
• 
  Richard Beigel, Joan Feigenbaum:
  On Being Incoherent Without Being Very Hard. Comput. Complex. 2: 1-17 (1992)
• 
  Stephen J. Bellantoni, Stephen A. Cook:
  A New Recursion-Theoretic Characterization of the Polytime Functions. Comput. Complex. 2: 97-110 (1992)
• 
  Omer Berkman, Yossi Matias, Uzi Vishkin:
  Randomized Range-Maxima in Nearly-Constant Parallel Time. Comput. Complex. 2: 350-373 (1992)
• 
  Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
  Fast Exponentiation Using the Truncation Operation. Comput. Complex. 2: 244-255 (1992)
• 
  Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern:
  Improved Low-Density Subset Sum Algorithms. Comput. Complex. 2: 111-128 (1992)
• 
  Joachim von zur Gathen, Victor Shoup:
  Computing Frobenius Maps and Factoring Polynomials. Comput. Complex. 2: 187-224 (1992)
• 
  Mikael Goldmann, Johan Håstad, Alexander A. Razborov:
  Majority Gates VS. General Weighted Threshold Gates. Comput. Complex. 2: 277-300 (1992)
• 
  Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen:
  Polynomial-Time Compression. Comput. Complex. 2: 18-39 (1992)
• 
  D. Yu. Grigoryev, Nicolai N. Vorobjov Jr.:
  Counting Connected Components of a Semialgebraic Set in Subexponential Time. Comput. Complex. 2: 133-186 (1992)
• 
  Katia S. Guimarães, William I. Gasarch, James M. Purtilo:
  Selection Problems via M-Ary Queries. Comput. Complex. 2: 256-276 (1992)
• 
  Johannes Köbler, Uwe Schöning, Jacobo Torán:
  Graph Isomorphism is Low for PP. Comput. Complex. 2: 301-330 (1992)
• 
  James F. Lynch:
  The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity. Comput. Complex. 2: 40-66 (1992)
• 
  Lajos Rónyai:
  Algorithmic Properties of Maximal Orders in Simple Algebras over Q. Comput. Complex. 2: 225-243 (1992)
• 
  Mohammad Amin Shokrollahi:
  Efficient Randomized Generation of Optimal Algorithms for Multiplication in Certain Finite Fields. Comput. Complex. 2: 67-96 (1992)
• 
  Igor E. Shparlinski:
  A Deterministic Test for Permutation Polynomials. Comput. Complex. 2: 129-132 (1992)