„Complexity lower bounds“

Suchergebnisse

1.000+ Treffer

• Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity
  Dinur, Irit ; Meir, Or
• Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems
  Abboud, Amir ; Cohen-Addad, Vincent ; Lee, Euiwoong ; Manurangsi, Pasin 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
  Bansal, Nikhil ; Oosterwijk, Tim ; Vredeveld, Tjark ; Zwaan, Ruben van der
• Reasons for Hardness in QBF Proof Systems
  Beyersdorff, Olaf ; Hinde, Luke ; Pich, Ján 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
  Bringmann, Karl ; Grønlund, Allan ; Künnemann, Marvin ; Larsen, Kasper Green
• On the Amortized Complexity of Approximate Counting
  Aden-Ali, Ishaq ; Han, Yanjun ; Nelson, Jelani ; Yu, Huacheng 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
  Foucaud, Florent ; Galby, Esther ; Khazaliya, Liana ; Li, Shaohua ; Mc Inerney, Fionn ; Sharma, Roohani ; Tale, Prafullkumar 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Lower Bounds on Retroactive Data Structures
  Chung, Lily ; Demaine, Erik D. ; Hendrickson, Dylan ; Lynch, Jayson 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Metric Dimension and Geodetic Set Parameterized by Vertex Cover
  Foucaud, Florent ; Galby, Esther ; Khazaliya, Liana ; Li, Shaohua ; Mc Inerney, Fionn ; Sharma, Roohani ; Tale, Prafullkumar 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Genuine Lower Bounds for QBF Expansion
  Beyersdorff, Olaf ; Blinkhorn, Joshua 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On optimal error rates for strong approximation of stochastic differential equations with irregular drift coefficients
  Ellinger, Simon ; Müller-Gronbach, Thomas ; Yaroslavtseva, Larisa ; Neuenkirch, Andreas 2025 Universität Passau
• Lower Bounds on the Sample Complexity of Species Tree Estimation when Substitution Rates Vary Across Loci
  Hill, Max ; Roch, Sebastien
• Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
  Hegerfeld, Falko ; Kratsch, Stefan ; Siebertz, Sebastian ; Nederlof, Jesper 2023 Humboldt-Universität zu Berlin
• Advanced tools and methods for treewidth-based problem solving
  Hecher, Markus ; Woltran, Stefan ; Schaub, Torsten ; Truszczynski, Mirosław ; Vollmer, Heribert 2021 Universität Potsdam
• Complexity of Normal Forms on Structures of Bounded Degree
  Heimberg, Lucas ; Schweikardt, Nicole ; Kuske, Dietrich ; Kreutzer, Stephan 2018 Humboldt-Universität zu Berlin
• IPS Lower Bounds for Formulas and Sum of ROABPs
  Chatterjee, Prerona ; Ghosal, Utsab ; Mukhopadhyay, Partha ; Sinhababu, Amit 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity theoretic lower bounds on cryptographic functions
  Kiltz, Eike
• Algorithms for Sensor Systems – 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers
  Scheideler, Christian 2010 Springer Berlin Heidelberg
• Inferring Lower Bounds for Runtime Complexity
  Frohn, Florian ; Giesl, Jürgen ; Hensel, Jera ; Aschermann, Cornelius ; Ströder, Thomas 2015 Universitätsbibliothek der RWTH Aachen
• Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs
  Itsykson, Dmitry ; Riazanov, Artur ; Sagunov, Danil ; Smirnov, Petr