• 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

• 2013
• 
  Scott Aaronson, Alex Arkhipov:
  The Computational Complexity of Linear Optics. Theory Comput. 9: 143-252 (2013)
• 
  Scott Aaronson, Paul F. Christiano:
  Quantum Money from Hidden Subspaces. Theory Comput. 9: 349-401 (2013)
• 
  Noga Alon, Shachar Lovett:
  Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions. Theory Comput. 9: 559-577 (2013)
• 
  Alexandr Andoni, Atri Rudra:
  Special Issue: APPROX-RANDOM 2012: Guest Editors' Foreword. Theory Comput. 9: 437-439 (2013)
• 
  Per Austrin, Mark Braverman, Eden Chlamtac:
  Inapproximability of NP-Complete Variants of Nash Equilibrium. Theory Comput. 9: 117-142 (2013)
• 
  Avraham Ben-Aroya, Amnon Ta-Shma:
  Constructing Small-Bias Sets from Algebraic-Geometric Codes. Theory Comput. 9: 253-272 (2013)
• 
  Eli Ben-Sasson, Ariel Gabizon:
  Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic. Theory Comput. 9: 665-683 (2013)
• 
  Aditya Bhaskara, Devendra Desai, Srikanth Srinivasan:
  Optimal Hitting Sets for Combinatorial Shapes. Theory Comput. 9: 441-470 (2013)
• 
  Eric Blais, Li-Yang Tan:
  Hypercontractivity Via the Entropy Method. Theory Comput. 9: 889-896 (2013)
• 
  Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff:
  Pseudorandomness for Width-2 Branching Programs. Theory Comput. 9: 283-293 (2013)
• 
  Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki:
  The Power of Nondeterminism in Self-Assembly. Theory Comput. 9: 1-29 (2013)
• 
  Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan:
  Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. Theory Comput. 9: 897-945 (2013)
• 
  Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola:
  On Beating the Hybrid Argument. Theory Comput. 9: 809-843 (2013)
• 
  Uriel Feige, Elchanan Mossel, Dan Vilenchik:
  Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. Theory Comput. 9: 617-651 (2013)
• 
  Daniel Gottesman, Sandy Irani:
  The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems. Theory Comput. 9: 31-116 (2013)
• 
  Venkatesan Guruswami, Ali Kemal Sinop:
  Improved Inapproximability Results for Maximum k-Colorable Subgraph. Theory Comput. 9: 413-435 (2013)
• 
  Johan Håstad:
  Satisfying Degree-d Equations over GF[2]ⁿ. Theory Comput. 9: 845-862 (2013)
• 
  Pavel Hrubes:
  On the Real τ-Conjecture and the Distribution of Complex Roots. Theory Comput. 9: 403-411 (2013)
• 
  Daniel M. Kane:
  A Monotone Function Given By a Low-Depth Decision Tree That Is Not an Approximate Junta. Theory Comput. 9: 587-592 (2013)
• 
  Subhash Khot, Muli Safra:
  A Two-Prover One-Round Game with Strong Soundness. Theory Comput. 9: 863-887 (2013)
• 
  Reut Levi, Dana Ron, Ronitt Rubinfeld:
  Testing Properties of Collections of Distributions. Theory Comput. 9: 295-347 (2013)
• 
  Stephan Mertens, Cristopher Moore:
  The Complexity of the Fermionant and Immanants of Constant Width [Note]. Theory Comput. 9: 273-282 (2013)
• 
  Elchanan Mossel, Ryan O'Donnell:
  Special Issue on Analysis of Boolean Functions: Guest Editors' Foreword. Theory Comput. 9: 579-585 (2013)
• 
  Jakob Nordström, Johan Håstad:
  Towards an Optimal Separation of Space and Length in Resolution. Theory Comput. 9: 471-557 (2013)
• 
  Noga Ron-Zewi, Madhu Sudan:
  A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes. Theory Comput. 9: 783-807 (2013)
• 
  Daniel Sheldon, Neal E. Young:
  Hamming Approximation of NP Witnesses. Theory Comput. 9: 685-702 (2013)
• 
  Alexander A. Sherstov:
  Making Polynomials Robust to Noise. Theory Comput. 9: 593-615 (2013)
• 
  Alexander A. Sherstov:
  Approximating the AND-OR Tree. Theory Comput. 9: 653-663 (2013)
• 
  Ola Svensson:
  Hardness of Vertex Deletion and Project Scheduling. Theory Comput. 9: 759-781 (2013)
• 
  Cenny Wenner:
  Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four. Theory Comput. 9: 703-757 (2013)