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

• 1997
• 
  Marco Cesati, Luca Trevisan:
  On the Efficiency of Polynomial Time Approximation Schemes. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Richard Beigel, Alexis Maciel:
  Upper and Lower Bounds for Some Depth-3 Circuit Classes. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Sanjeev Arora, Madhu Sudan:
  Improved low-degree testing and its applications. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Marek Karpinski, Alexander Zelikovsky:
  Approximating Dense Cases of Covering Problems. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Moni Naor, Omer Reingold:
  On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Marco Cesati, Miriam Di Ianni:
  Parameterized Parallel Complexity. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Stasys Jukna:
  Exponential Lower Bounds for Semantic Resolution. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Noam Nisan, Ziv Bar-Yossef:
  Pointer Jumping Requires Concurrent Read. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
  The Computational Complexity of Some Problems of Linear Algebra. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Marcos A. Kiwi:
  Testing and Weight Distributions of Dual Codes. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
  Weak Random Sources, Hitting Sets, and BPP Simulations. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Luca Trevisan:
  On Local versus Global Satisfiability. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Bernd Borchert, Dietrich Kuske, Frank Stephan:
  On Existentially First-Order Definable Languages and their Relation to NP. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Klaus Reinhardt, Eric Allender:
  Making Nondeterminism Unambiguous. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Jan Krajícek:
  Interpolation by a Game. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Manindra Agrawal, Eric Allender, Samir Datta:
  On TC⁰, AC⁰, and Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Marek Karpinski, Juergen Wirtgen, Alexander Zelikovsky:
  An Approximation Algorithm for the Bandwidth Problem on Dense Graphs. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Oded Goldreich, Shafi Goldwasser, Shai Halevi:
  Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Martin Sauerhoff:
  A Lower Bound for Randomized Read-k-Times Branching Programs. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Oded Goldreich:
  A Sample of Samplers - A Computational Perspective on Sampling (survey). Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Farid M. Ablayev:
  Randomization and nondeterminsm are incomparable for ordered read-once branching programs. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Gunnar Andersson, Lars Engebretsen:
  Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener:
  On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Marek Karpinski:
  Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Harald Hempel, Gerd Wechsung:
  The Operators min and max on the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Jochen Meßner, Jacobo Torán:
  Optimal proof systems for Propositional Logic and complete sets. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Johannes Merkle, Ralph Werchner:
  On the Security of Server aided RSA protocols. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Scott E. Decatur, Oded Goldreich, Dana Ron:
  Computational Sample Complexity. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger:
  On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. Electron. Colloquium Comput. Complex. TR97 (1997)
• 
  Martin Sauerhoff:
  On Nondeterminism versus Randomness for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR97 (1997)

skipping 31 more matches