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

• 1988
• 
  Eric Allender, Osamu Watanabe:
  Kolmogorov complexity and degrees of tally sets. SCT 1988: 102-111
• 
  José L. Balcázar:
  Logspace self-reducibility. SCT 1988: 40-46
• 
  David A. Mix Barrington, Neil Immerman, Howard Straubing:
  On uniformity within NC¹. SCT 1988: 47-59
• 
  Ronald V. Book, Ding-Zhu Du, David A. Russo:
  On polynomial and generalized complexity cores. SCT 1988: 236-250
• 
  Allan Borodin:
  Juris Hartmanis: building a department-building a discipline. SCT 1988: 135-137
• 
  Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa:
  Two applications of complementation via inductive counting. SCT 1988: 116-125
• 
  Samuel R. Buss, Louise Hay:
  On truth-table reducibility to SAT and the difference hierarchy over NP. SCT 1988: 224-233
• 
  Jin-Yi Cai, Lane A. Hemachandra:
  Enumerative counting is hard. SCT 1988: 194-203
• 
  Anne Condon:
  Space bounded probabilistic game automata. SCT 1988: 162-174
• 
  Lance Fortnow, John Rompel, Michael Sipser:
  On the power of multi-power interactive protocols. SCT 1988: 156-161
• 
  Bernd Halstenberg, Rüdiger Reischuk:
  Relations between communication complexity classes. SCT 1988: 19-28
• 
  Dung T. Huynh:
  The complexity of ranking. SCT 1988: 204-212
• 
  Oscar H. Ibarra, Tao Jiang:
  Trading reversals for alternation. SCT 1988: 70-77
• 
  Neil Immerman:
  Nondeterministic space is closed under complementation. SCT 1988: 112-115
• 
  Russell Impagliazzo, Moni Naor:
  Decision trees and downward closures. SCT 1988: 29-38
• 
  Jim Kadin:
  The polynomial time hierarchy collapses if the Boolean hierarchy collapses. SCT 1988: 278-292
• 
  Ker-I Ko:
  Relativized polynomial time hierarchies having exactly K levels. SCT 1988
• 
  Ker-I Ko:
  Distinguishing bounded reducibilities by sparse sets. SCT 1988: 181-191
• 
  Ming Li, Paul M. B. Vitányi:
  Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87. SCT 1988: 80-101
• 
  Luc Longpré, Paul Young:
  Cook is faster than Karp: a study of reducibilities in NP. SCT 1988: 293-302
• 
  Jack H. Lutz:
  Pseudorandom sources for BPP. SCT 1988: 175-180
• 
  Leonard Pitt, Manfred K. Warmuth:
  Reductions among prediction problems: on the difficulty of predicting automata. SCT 1988: 60-69
• 
  Uwe Schöning:
  The power of counting. SCT 1988: 2-9
• 
  Juichi Shinoda, Theodore A. Slaman:
  On the theory of the PTIME degrees of the recursive sets. SCT 1988: 252-257
• 
  Richard Edwin Stearns:
  Juris Hartmanis: the beginnings of computational complexity. SCT 1988: 128-134
• 
  Shouwen Tang, Osamu Watanabe:
  On tally relativizations of BP-complexity classes. SCT 1988: 10-18
• 
  Jacobo Torán:
  An oracle characterization of the counting hierarchy. SCT 1988: 213-223
• 
  Klaus W. Wagner:
  Bounded query computations. SCT 1988: 260-277
• 
  Paul Young:
  Juris Hartmanis: fundamental contributions to isomorphism problems. SCT 1988: 138-154
• 
  Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988. IEEE Computer Society 1988, ISBN 0-8186-0794-7 [contents]