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

• 1987
• 
  Martín Abadi, Joan Feigenbaum, Joe Kilian:
  On hiding information from an oracle. SCT 1987: 9
• 
  Eric Allender:
  Some consequences of the existence of pseudorandom generators. SCT 1987: 157
• 
  Klaus Ambos-Spies:
  Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem. SCT 1987: 60-68
• 
  Amihood Amir, William I. Gasarch:
  Polynomial terse sets. SCT 1987: 22-27
• 
  Richard Beigel:
  A structural theorem that depends quantitatively on the complexity of SAT. SCT 1987: 28-32
• 
  Ronald V. Book, Ker-I Ko:
  On sets reducible to sparse sets. SCT 1987: 147-154
• 
  Jonathan F. Buss:
  A theory of oracle machines. SCT 1987: 175-181
• 
  Jin-Yi Cai, Merrick L. Furst:
  PSPACE survives three-bit bottlenecks. SCT 1987: 94-102
• 
  Jianer Chen, Chee-Keng Yap:
  Reversal complexity. SCT 1987: 14-19
• 
  Moon-Jung Chung, Bala Ravikumar:
  Strong nondeterministic reduction - a technique for proving intractability. SCT 1987: 132-137
• 
  Sophocles Ephremidis, Christos H. Papadimitriou, Martha Sideri:
  Complexity characterizations of attribute grammar languages. SCT 1987: 10-13
• 
  Lance Fortnow:
  The complexity of perfect zero-knowledge. SCT 1987: 156
• 
  Judy Goldsmith, Deborah Joseph, Paul Young:
  Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set. SCT 1987: 50-59
• 
  Juris Hartmanis, Lane A. Hemachandra:
  One-way functions, robustness, and the non-isomorphism of NP-complete sets. SCT 1987: 160-174
• 
  Lane A. Hemachandra:
  On ranking. SCT 1987: 103-117
• 
  Lane A. Hemachandra:
  The strong exponential hierarchy collapses. SCT 1987: 191
• 
  Neil Immerman:
  Expressibility as a complexity measure: results and directions. SCT 1987: 194-202
• 
  Jim Kadin:
  P^NP[log n] and sparse turing complete sets for NP. SCT 1987: 33-40
• 
  Ker-I Ko:
  On helping by robust oracle machines. SCT 1987: 182-190
• 
  Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
  Progress on collapsing degrees. SCT 1987: 126-131
• 
  Daniel Leivant:
  Characterization of complexity classes in higher-order logic. SCT 1987: 203-217
• 
  Jack H. Lutz:
  Resource bounded baire category and small circuits in exponential space. SCT 1987: 81-91
• 
  Anil Nerode, Jeffrey B. Remmel:
  Complexity theoretic algebra I - vector spaces over finite fields. SCT 1987: 218-239
• 
  Kenneth W. Regan:
  Unprovably intractable languages. SCT 1987: 69-80
• 
  John H. Reif:
  On threshold circuits and polynomial computation. SCT 1987: 118-123
• 
  Georg Schnitger, Bala Kalyanasundaram:
  The probabilistic communication complexity of set intersection. SCT 1987: 41-47
• 
  Uwe Schöning:
  Probabilistic complexity classes and lowness. SCT 1987: 2-8
• 
  Osamu Watanabe:
  Polynomial time reducibility to a set of small density. SCT 1987: 138-146
• 
  Proceedings of the Second Annual Conference on Structure in Complexity Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987. IEEE Computer Society 1987, ISBN 978-0-8186-0794-3 [contents]