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

• 2024
• 
  Daniel Avraham, Amir Yehudayoff:
  On Blocky Ranks Of Matrices. Comput. Complex. 33(1): 2 (2024)
• 
  Ferenc Bencs, Jeroen Huijben, Guus Regts:
  Approximating the chromatic polynomial is as hard as computing it exactly. Comput. Complex. 33(1): 1 (2024)
• 
  Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk:
  Determinants vs. Algebraic Branching Programs. Comput. Complex. 33(2): 11 (2024)
• 
  Hubie Chen:
  Algebraic Global Gadgetry for Surjective Constraint Satisfaction. Comput. Complex. 33(1): 7 (2024)
• 
  Pranjal Dutta, Nitin Saxena, Thomas Thierauf:
  Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply VP ≠q VNP. Comput. Complex. 33(1): 3 (2024)
• 
  Yuval Filmus, Yuval Ishai, Avi Kaplan, Guy Kindler:
  Limits of Preprocessing. Comput. Complex. 33(1): 5 (2024)
• 
  Zeyu Guo:
  Variety Evasive Subspace Families. Comput. Complex. 33(2): 10 (2024)
• 
  Laurence Kluge:
  Combinatorial refinement on circulant graphs. Comput. Complex. 33(2): 9 (2024)
• 
  Ján Pich:
  Localizability of the approximation method. Comput. Complex. 33(2): 12 (2024)
• 
  Miroslav Rada, Michal Cerný, Ondrej Sokol:
  The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability. Comput. Complex. 33(2): 8 (2024)
• 
  Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
  KRW Composition Theorems via Lifting. Comput. Complex. 33(1): 4 (2024)
• 
  Dominik Scheder, John P. Steinberger:
  PPSZ for General k-SAT and CSP - Making Hertli's Analysis Simpler and 3-SAT Faster. Comput. Complex. 33(2): 13 (2024)
• 
  Noah G. Singer, Madhu Sudan, Santhoshini Velusamy:
  Streaming approximation resistance of every ordering CSP. Comput. Complex. 33(1): 6 (2024)
• 2023
• 
  Rishabh Batra, Nitin Saxena, Devansh Shringi:
  Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q. Comput. Complex. 32(1): 2 (2023)
• 
  Ilario Bonacina, Nicola Galesi, Massimo Lauria:
  On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Comput. Complex. 32(2): 12 (2023)
• 
  Olivier Bournez, Arnaud Durand:
  A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations. Comput. Complex. 32(2): 7 (2023)
• 
  Jin-Yi Cai, Zhiguo Fu, Kurt Girstmair, Michael Kowalczyk:
  A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory. Comput. Complex. 32(1): 4 (2023)
• 
  Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
  Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Comput. Complex. 32(1): 3 (2023)
• 
  Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
  Improving 3N Circuit Complexity Lower Bounds. Comput. Complex. 32(2): 13 (2023)
• 
  Ashrujit Ghoshal, Ilan Komargodski:
  On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. Comput. Complex. 32(2): 9 (2023)
• 
  Oded Goldreich, Dana Ron:
  A Lower Bound on the Complexity of Testing Grained Distributions. Comput. Complex. 32(2): 11 (2023)
• 
  Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
  The Power of Natural Properties as Oracles. Comput. Complex. 32(2): 6 (2023)
• 
  Michael Kaminski, Igor E. Shparlinski, Michel Waldschmidt:
  On sets of linear forms of maximal complexity. Comput. Complex. 32(1): 1 (2023)
• 
  Pascal Koiran, Subhayan Saha:
  Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond. Comput. Complex. 32(2): 8 (2023)
• 
  Caroline Mattes, Armin Weiß:
  Parallel algorithms for power circuits and the word problem of the Baumslag group. Comput. Complex. 32(2): 10 (2023)
• 
  Ronen Shaltiel:
  Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? Comput. Complex. 32(1): 5 (2023)
• 2022
• 
  Vishwas Bhargava, Sumanta Ghosh:
  Improved Hitting Set for Orbit of ROABPs. Comput. Complex. 31(2): 15 (2022)
• 
  Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
  Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. Comput. Complex. 31(2): 9 (2022)
• 
  Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski:
  Zeros and approximations of Holant polynomials on the complex plane. Comput. Complex. 31(2): 11 (2022)
• 
  Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
  Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. Comput. Complex. 31(2): 8 (2022)

skipping 519 more matches