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

• 1991
• 
  Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe:
  Relating Equivalence and Reducibility to Sparse Sets. SCT 1991: 220-229
• 
  László Babai, Noam Nisan:
  BPP has Subexponential Time Simulation unless EXPTIME has Pubishable Proofs. SCT 1991: 213-219
• 
  José L. Balcázar:
  Adaptive Logspace and Depth-Bounded Reducibilities. SCT 1991: 240-254
• 
  David A. Mix Barrington, Howard Straubing:
  Superlinear Lower Bounds for Bounded-Width Branching Programs. SCT 1991: 305-313
• 
  Richard Beigel, Nick Reingold, Daniel A. Spielman:
  The Perceptron Strikes Back. SCT 1991: 286-291
• 
  Stephen J. Bellantoni, Toniann Pitassi, Alasdair Urquhart:
  Approximation and Small Depth Frege Proofs. SCT 1991: 367-390
• 
  Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri:
  Complexity Classes and Sparse Oracles. SCT 1991: 102-108
• 
  Jin-yi Cai, Anne Condon, Richard J. Lipton:
  PSPACE Is Provable By Two Provers In One Round. SCT 1991: 110-115
• 
  Richard Chang, Jim Kadin, Pankaj Rohatgi:
  Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. SCT 1991: 255-269
• 
  Jeff Edmonds:
  Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines. SCT 1991: 322-331
• 
  Uriel Feige:
  On the Success Probability of the Two Provers in One-Round Proof Systems. SCT 1991: 116-123
• 
  Joan Feigenbaum, Lance Fortnow:
  On the Random-Self-Reducibility of Complete Sets. SCT 1991: 124-132
• 
  Stephen A. Fenner:
  Notions of Resource-Bounded Category and Genericity. SCT 1991: 196-212
• 
  Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz:
  Gap-Definable Counting Classes. SCT 1991: 30-42
• 
  Lance Fortnow, Nick Reingold:
  PP is Closed Under Truth-Table Reductions. SCT 1991: 13-15
• 
  William I. Gasarch:
  Bounded Queries in Recursion Theory: A Survey. SCT 1991: 62-78
• 
  Ricard Gavaldà, Osamu Watanabe:
  On the Computational Complexity of Small Descriptions. SCT 1991: 89-101
• 
  Erich Grädel:
  Capturing Complexity Classes by Fragments of Second Order Logic. SCT 1991: 341-352
• 
  Michelangelo Grigni, Michael Sipser:
  Monotone Separation of Logspace from NC. SCT 1991: 294-298
• 
  Sanjay Gupta:
  The Power of Witness Reduction. SCT 1991: 43-59
• 
  Rafi Heiman, Avi Wigderson:
  Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions. SCT 1991: 172-179
• 
  Steven Homer, Luc Longpré:
  On Reductions of NP Sets to Sparse Sets. SCT 1991: 79-88
• 
  Neil Immerman:
  DSPACE[n^k] = VAR[k+1]. SCT 1991: 334-340
• 
  Mauricio Karchmer, Ran Raz, Avi Wigderson:
  Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. SCT 1991: 299-304
• 
  Phokion G. Kolaitis, Madhukar N. Thakur:
  Approximation Properties of NP Minimization Classes. SCT 1991: 353-366
• 
  Matthias Krause:
  Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing. SCT 1991: 314-321
• 
  Ming Li, Paul M. B. Vitányi:
  Combinatorics and Kolmogorov Complexity. SCT 1991: 154-163
• 
  Jack H. Lutz:
  A Pseudorandom Oracle Characterization of BPP. SCT 1991: 190-195
• 
  Jack H. Lutz, William J. Schmidt:
  Errata for Circuit Size to Pseudorandom Oracles. SCT 1991: 392
• 
  Peter Bro Miltersen:
  The Complexity of Malign Ensembles. SCT 1991: 164-171

skipping 9 more matches