„average-case complexity“

Suchergebnisse

1.000+ Treffer

• Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword
  Goldreich, Oded ; Vadhan, Salil
• Structure in average case complexity
  Karg, Christoph ; Schuler, Rainer 1995 Univ., Fak. für Informatik
• Structural average case complexity
  Schuler, Rainer ; Yamakami, Tomoyuki 1995 Univ., Fak. für Informatik
• k-shortest path: average-case analysis and practical improvements
  Schickedanz, Alexander ; Meyer, Ulrich ; Ajwani, Deepak 2023 Universitätsbibliothek Johann Christian Senckenberg
• Average-case complexity of shortest-paths problems
  Priebe, Volker
• Worst case instances are fragile – average case and smoothed competitive analysis of algorithms
  Schäfer, Guido
• Correction to: Minimum average case time complexity for sorting algorithms
  Dutta, Anurag ; Choudhury, Manan Roy ; Sharma, Rakesh K.
• The Planted Orthogonal Vectors Problem
  Kühnemann, David ; Polak, Adam ; Rosen, Alon 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Hardness Amplification of Optimization Problems
  Goldenberg, Elazar ; Karthik C. S. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Switching Graph Matrix Norm Bounds: From i.i.d. to Random Regular Graphs
  Xu, Jeff 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Hardness Amplification for Real-Valued Functions
  Li, Yunqi ; Vasudevan, Prashant Nalini 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Approximation Complexity in Average Case Setting for Tensor Degrees of Random Processes
  Pyatkin, K. A. ; Khartov, A. A.
• An Optimal Error-Correcting Reduction for Matrix Multiplication
  Hirahara, Shuichi ; Shimizu, Nobutaka 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Worst-Case and Average-Case Hardness of Hypercycle and Database Problems
  Fu, Cheng-Hao ; Lincoln, Andrea ; Reyes, Rene 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms
  Nicaud, Cyril ; Pivoteau, Carine ; Vialette, Stéphane 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Average case polyhedral complexity of the maximum stable set problem
  Braun, Gábor ; Fiorini, Samuel ; Pokutta, Sebastian
• Average Case Polyhedral Complexity of the Maximum Stable Set Problem
  Braun, Gábor ; Fiorini, Samuel ; Pokutta, Sebastian 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity
  Hirahara, Shuichi ; Kabanets, Valentine ; Lu, Zhenjian ; Oliveira, Igor C. 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Limits of Sequential Local Algorithms on the Random k-XORSAT Problem
  Yung, Kingsley 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Impagliazzo’s Worlds Through the Lens of Conditional Kolmogorov Complexity
  Lu, Zhenjian ; Santhanam, Rahul 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik