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

• 2020
• 
  Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
  Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead. CCC 2020: 32:1-32:15
• 
  Mrinal Kumar, Ben Lee Volk:
  Lower Bounds for Matrix Factorization. CCC 2020: 5:1-5:20
• 
  Robert Andrews:
  Algebraic Hardness Versus Randomness in Low Characteristic. CCC 2020: 37:1-37:32
• 
  Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, Ruizhe Zhang:
  On the Quantum Complexity of Closest Pair and Related Problems. CCC 2020: 16:1-16:43
• 
  Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler:
  Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. CCC 2020: 7:1-7:47
• 
  Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß:
  Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. CCC 2020: 29:1-29:29
• 
  Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
  Near-Optimal Erasure List-Decodable Codes. CCC 2020: 1:1-1:27
• 
  Huck Bennett, Chris Peikert:
  Hardness of Bounded Distance Decoding on Lattices in ℓ_p Norms. CCC 2020: 36:1-36:21
• 
  Amey Bhangale, Subhash Khot:
  Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut. CCC 2020: 9:1-9:15
• 
  Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
  Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CCC 2020: 21:1-21:24
• 
  Jin-Yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu:
  Approximability of the Eight-Vertex Model. CCC 2020: 4:1-4:18
• 
  Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
  A Quadratic Lower Bound for Algebraic Branching Programs. CCC 2020: 2:1-2:21
• 
  Eshan Chattopadhyay, Jyun-Jie Liao:
  Optimal Error Pseudodistributions for Read-Once Branching Programs. CCC 2020: 25:1-25:27
• 
  Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
  Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. CCC 2020: 14:1-14:27
• 
  Kuan Cheng, William M. Hoza:
  Hitting Sets Give Two-Sided Derandomization of Small Space. CCC 2020: 10:1-10:25
• 
  Gil Cohen, Shahar Samocha:
  Palette-Alternating Tree Codes. CCC 2020: 11:1-11:29
• 
  Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts:
  Statistical Physics Approaches to Unique Games. CCC 2020: 13:1-13:27
• 
  Daniel Dadush, Samarth Tiwari:
  On the Complexity of Branching Proofs. CCC 2020: 34:1-34:35
• 
  Jacques Dark, Christian Konrad:
  Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. CCC 2020: 30:1-30:14
• 
  Dean Doron, Pooya Hatami, William M. Hoza:
  Log-Seed Pseudorandom Generators via Iterated Restrictions. CCC 2020: 6:1-6:36
• 
  Yuval Filmus, Yuval Ishai, Avi Kaplan, Guy Kindler:
  Limits of Preprocessing. CCC 2020: 17:1-17:22
• 
  Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
  Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. CCC 2020: 12:1-12:17
• 
  Mika Göös, Pritish Kamath, Katerina Sotiraki, Manolis Zampetakis:
  On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem. CCC 2020: 19:1-19:42
• 
  Nikhil Gupta, Chandan Saha, Bhargav Thankey:
  A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. CCC 2020: 23:1-23:31
• 
  Hamed Hatami, Kaave Hosseini, Shachar Lovett:
  Sign Rank vs Discrepancy. CCC 2020: 18:1-18:14
• 
  Shuichi Hirahara:
  Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions. CCC 2020: 20:1-20:47
• 
  Rahul Ilango:
  Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas. CCC 2020: 31:1-31:35
• 
  Rahul Ilango, Bruno Loff, Igor C. Oliveira:
  NP-Hardness of Circuit Minimization for Multi-Output Functions. CCC 2020: 22:1-22:36
• 
  Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
  Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. CCC 2020: 15:1-15:41
• 
  Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam:
  Geometric Rank of Tensors and Subrank of Matrix Multiplication. CCC 2020: 35:1-35:21

skipping 10 more matches