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

• 1994
• 
  Manindra Agrawal:
  On the Isomorphism Problem for Weak Reducibilities. SCT 1994: 338-355
• 
  Manindra Agrawal, Vikraman Arvind:
  Polynomial Time Truth-Table Reductions to P-Selective Sets. SCT 1994: 24-30
• 
  Eric Allender, Mitsunori Ogihara:
  Relationships Among PL, #L, and the Determinant. SCT 1994: 267-278
• 
  David A. Mix Barrington, Neil Immerman:
  Time, Hardware, and Uniformity. SCT 1994: 176-185
• 
  Richard Beigel, Judy Goldsmith:
  Downward separation fails catastrophically for limited nondeterminism classes. SCT 1994: 134-138
• 
  Richard Beigel, Martin Kummer, Frank Stephan:
  Approximable Sets. SCT 1994: 12-23
• 
  Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz:
  On Ultrafilters and NP. SCT 1994: 97-105
• 
  Bernd Borchert:
  Predicate Classes and Promise Classes. SCT 1994: 235-241
• 
  Harry Buhrman, Jim Kadin, Thomas Thierauf:
  On Functions Computable with Nonadaptive Queries to NP. SCT 1994: 43-52
• 
  Harry Buhrman, Pekka Orponen:
  Random Strings Make Hard Instances. SCT 1994: 217-222
• 
  Harry Buhrman, Leen Torenvliet:
  On the Structure of Complete Sets. SCT 1994: 118-133
• 
  Richard Chang:
  On the Query Complexity of Clique Size and Maximum Satisfiability. SCT 1994: 31-42
• 
  Kevin J. Compton, Erich Grädel:
  Logical Definability of Counting Functions. SCT 1994: 255-266
• 
  Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
  Random Debaters and the Hardness of Approximating Stochastic Functions. SCT 1994: 280-293
• 
  Lance Fortnow, Tomoyuki Yamakami:
  Generic Separations. SCT 1994: 139-145
• 
  Ricard Gavaldà:
  The Complexity of Learning with Queries. SCT 1994: 324-337
• 
  Ulrich Hertrampf:
  Complexity Classes Defined via k-valued Functions. SCT 1994: 224-234
• 
  Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns:
  Generalized CNF Satisfiability Problems and Non-Efficient. SCT 1994: 356-366
• 
  Russell Impagliazzo, Ran Raz, Avi Wigderson:
  A Direct Product Theorem. SCT 1994: 88-96
• 
  Birgit Jenner, Pierre McKenzie, Denis Thérien:
  Logspace and Logtime Leaf Languages. SCT 1994: 242-254
• 
  Deborah Joseph, Randall Pruim, Paul Young:
  Collapsing Degrees in Subexponential Time. SCT 1994: 367-382
• 
  Steven M. Kautz, Peter Bro Miltersen:
  Relative to a Random Oracle, NP is Not Small. SCT 1994: 162-174
• 
  Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram:
  Alternation in Interaction. SCT 1994: 294-303
• 
  Klaus-Jörn Lange, Peter Rossmanith:
  Unambiguous Polynomial Hierarchies and Exponential Size. SCT 1994: 106-115
• 
  Richard J. Lipton:
  Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions. SCT 1994: 79-87
• 
  Maciej Liskiewicz, Rüdiger Reischuk:
  The Complexity World below Logarithmic Space. SCT 1994: 64-78
• 
  Jack H. Lutz:
  Weakly Hard Problems. SCT 1994: 146-161
• 
  Bernd Meyer:
  Constructive Separation of Classes of Indistinguishable Ensembles. SCT 1994: 198-204
• 
  Sarah Mocas:
  Using Bounded Query Classes to Separate Classes in the Exponential Time Hierarchy from Classes in PH. SCT 1994: 53-58
• 
  Mitsunori Ogihara:
  Polynomial-Time Membership Comparable Sets. SCT 1994: 2-11

skipping 8 more matches