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

• 1997
• 
  Manindra Agrawal, Eric Allender, Samir Datta:
  On TC⁰, AC⁰, and Arithmetic Circuits. CCC 1997: 134-148
• 
  Klaus Ambos-Spies, Levke Bentzien:
  Separating NP-Completeness Notions under Strong Hypotheses. CCC 1997: 121-127
• 
  Vikraman Arvind, Jacobo Torán:
  A Nonadaptive NC Checker for Permutation Group Intersection. CCC 1997: 204-212
• 
  László Babai, Peter G. Kimmel:
  Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity. CCC 1997: 239-246
• 
  Richard Beigel, Bin Fu:
  Circuits Over PP and PL. CCC 1997: 24-35
• 
  Richard Beigel, Alexis Maciel:
  Upper and Lower Bounds for Some Depth-3 Circuit Classes. CCC 1997: 149-157
• 
  Christer Berg, Staffan Ulfberg:
  A Lower Bound for Perceptrons and an Oracle Separation of the PP^PH Hierarchy. CCC 1997: 165-172
• 
  Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien:
  Circuits and Expressions with NOn-Associative Gates. CCC 1997: 193-203
• 
  Bernd Borchert, Riccardo Silvestri:
  The General Notion of a Dot-Operator. CCC 1997: 36-44
• 
  Allan Borodin, Ran El-Yaniv:
  On Ranomization in Online Computation. CCC 1997: 226-238
• 
  Harry Buhrman, Lance Fortnow, Leen Torenvliet:
  Six Hypotheses in Search of a Theorem. CCC 1997: 2-12
• 
  Liming Cai, Jianer Chen, Johan Håstad:
  Circuit Bottom Fan-in and Computational Power. CCC 1997: 158-164
• 
  Jianer Chen, Donald K. Friesen, Hao Zheng:
  Tight Bound on Johnson's Algoritihm for Max-SAT. CCC 1997: 274-281
• 
  Pierluigi Crescenzi:
  A Short Guide to Approximation Preserving Reductions. CCC 1997: 262-273
• 
  Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov:
  Complexity and Expressive Power of Logic Programming. CCC 1997: 82-101
• 
  Rodney G. Downey, André Nies:
  Undecidability Results for Low Complexity Degree Structures. CCC 1997: 128-132
• 
  Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer:
  Hyper-Polynomial Hierarchies and the NP-Jump. CCC 1997: 102-110
• 
  Lance Fortnow:
  Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. CCC 1997: 52-60
• 
  Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
  Inequalities for Shannon entropies and Kolmogorov complexities. CCC 1997: 13-23
• 
  Ulrich Hertrampf:
  Acceptance by Transformation Monoids (with an Application to Local Self Reductions). CCC 1997: 213-224
• 
  Maren Hinrichs, Gerd Wechsung:
  Time Bounded Frequency Computations. CCC 1997: 185-192
• 
  Stasys Jukna:
  Finite Limits and Monotone Computations: The Lower Bounds Criterion. CCC 1997: 302-313
• 
  Christoph Karg:
  LR(k) Testing is Average Case Complete. CCC 1997: 74-80
• 
  Sanjeev Khanna, Madhu Sudan, Luca Trevisan:
  Constraint Satisfaction: The Approximability of Minimization Problems. CCC 1997: 282-296
• 
  Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp:
  Reversible Space Equals Deterministic Space. CCC 1997: 45-50
• 
  Jack H. Lutz, Yong Zhao:
  The Density of Weakly Complete Problems under Adaptive Reductions. CCC 1997: 111-120
• 
  Kenneth W. Regan:
  Polynomial Vicinity Circuits and Nonlinear Lower Bounds. CCC 1997: 61-68
• 
  Rainer Schuler:
  A Note on Universal Distributions for Polynomial-Time Computable Distributions. CCC 1997: 69-73
• 
  Janos Simon, Shi-Chun Tsai:
  A Note on the Bottleneck Counting Argument. CCC 1997: 297-301
• 
  Gábor Tardos, Uri Zwick:
  The Communication Complexity of the Universal Relation. CCC 1997: 247-259

skipping 2 more matches