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

• 2011
• 
  Scott Aaronson, Dieter van Melkebeek:
  On Circuit Lower Bounds from Derandomization. Theory Comput. 7(1): 177-184 (2011)
• 
  Kazuyuki Amano:
  Tight Bounds on the Average Sensitivity of k-CNF. Theory Comput. 7(1): 45-48 (2011)
• 
  Per Austrin, Subhash Khot, Muli Safra:
  Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. Theory Comput. 7(1): 27-43 (2011)
• 
  Salman Beigi, Peter W. Shor, John Watrous:
  Quantum Interactive Proofs with Short Messages. Theory Comput. 7(1): 101-117 (2011)
• 
  Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Ning Xie:
  Testing Linear-Invariant Non-Linear Properties. Theory Comput. 7(1): 75-99 (2011)
• 
  Elya Dolev, Dana Ron:
  Distribution-Free Testing for Monomials with a Sublinear Number of Queries. Theory Comput. 7(1): 155-176 (2011)
• 
  Zeev Dvir, Amir Shpilka:
  Noisy Interpolating Sets for Low-Degree Polynomials. Theory Comput. 7(1): 1-18 (2011)
• 
  Pavel Hrubes, Amir Yehudayoff:
  Arithmetic Complexity in Ring Extensions. Theory Comput. 7(1): 119-129 (2011)
• 
  Rahul Jain, Shengyu Zhang:
  The Influence Lower Bound Via Query Elimination. Theory Comput. 7(1): 147-153 (2011)
• 
  Robert Krauthgamer, Tim Roughgarden:
  Metric Clustering via Consistent Labeling. Theory Comput. 7(1): 49-74 (2011)
• 
  Shachar Lovett:
  Computing Polynomials with Few Multiplications. Theory Comput. 7(1): 185-188 (2011)
• 
  Shachar Lovett, Roy Meshulam, Alex Samorodnitsky:
  Inverse Conjecture for the Gowers Norm is False. Theory Comput. 7(1): 131-145 (2011)
• 
  Ashwin Nayak:
  Inverting a Permutation is as Hard as Unordered Search. Theory Comput. 7(1): 19-25 (2011)