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

• 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)
• 
  Susanna F. de Rezende, Aaron Potechin, Kilian Risse:
  Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients. CoRR abs/2404.16722 (2024)
• 
  Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang:
  Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. CoRR abs/2411.14267 (2024)
• 
  Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang:
  Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman. Electron. Colloquium Comput. Complex. TR24 (2024)
• 2023
• 
  Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse:
  Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. FOCS 2023: 1-11
• 
  Susanna F. de Rezende, Aaron Potechin, Kilian Risse:
  Clique Is Hard on Average for Unary Sherali-Adams. FOCS 2023: 12-25
• 2022
• 
  Susanna F. de Rezende, Mika Göös, Robert Robere:
  Guest Column: Proofs, Circuits, and Communication. SIGACT News 53(1): 59-82 (2022)
• 
  Susanna F. de Rezende, Mika Göös, Robert Robere:
  Proofs, Circuits, and Communication. CoRR abs/2202.08909 (2022)
• 2021
• 
  Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere:
  Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Comput. Complex. 30(1): 4 (2021)
• 
  Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
  Clique Is Hard on Average for Regular Resolution. J. ACM 68(4): 23:1-23:26 (2021)
• 
  Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Dmitry Sokolov:
  The Power of Negative Reasoning. CCC 2021: 40:1-40:24
• 
  Susanna F. de Rezende:
  Automating Tree-Like Resolution in Time n^{o(log n)} Is ETH-Hard. LAGOS 2021: 152-162
• 
  Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov:
  Automating algebraic proof systems is NP-hard. STOC 2021: 209-222
• 
  Susanna F. de Rezende:
  Automating Tree-Like Resolution in Time n^{o(log n)} Is ETH-Hard. Electron. Colloquium Comput. Complex. TR21 (2021)
• 
  Susanna F. de Rezende, Jakob Nordström, Marc Vinyals:
  How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). Electron. Colloquium Comput. Complex. TR21 (2021)
• 2020
• 
  Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
  Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CCC 2020: 28:1-28:24
• 
  Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
  KRW Composition Theorems via Lifting. FOCS 2020: 43-49
• 
  Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals:
  Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS 2020: 24-30
• 
  Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals:
  Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. CoRR abs/2001.02144 (2020)
• 
  Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere:
  Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CoRR abs/2001.02481 (2020)
• 
  Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
  KRW Composition Theorems via Lifting. CoRR abs/2007.02740 (2020)
• 
  Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov:
  Clique Is Hard on Average for Regular Resolution. CoRR abs/2012.09476 (2020)
• 
  Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Susanna F. de Rezende:
  Automating Algebraic Proof Systems is NP-Hard. Electron. Colloquium Comput. Complex. TR20 (2020)
• 
  Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende:
  Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Electron. Colloquium Comput. Complex. TR20 (2020)
• 
  Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere:
  KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. TR20 (2020)
• 2019
• 
  Susanna F. de Rezende:
  Lower Bounds and Trade-offs in Proof Complexity. Royal Institute of Technology, Stockholm, Sweden, 2019
• 
  Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere:
  Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CCC 2019: 18:1-18:16
• 
  Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
  Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. CoRR abs/1912.00534 (2019)
• 
  Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende:
  Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Electron. Colloquium Comput. Complex. TR19 (2019)
• 
  Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
  Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. Electron. Colloquium Comput. Complex. TR19 (2019)

skipping 6 more matches