„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Edge-b-Coloring Trees
  Campos, Victor ; Silva, Ana
• Beyond Representing Orthology Relations by Trees
  Huber, K. T. ; Scholz, G. E.
• Fixed-Parameter Tractable Distances to Sparse Graph Classes
  Bulian, Jannis ; Dawar, Anuj
• Near-Optimal Asymmetric Binary Matrix Partitions
  Abed, Fidaa ; Caragiannis, Ioannis ; Voudouris, Alexandros A.
• Improved Generic Attacks Against Hash-Based MACs and HAIFA
  Dinur, Itai ; Leurent, Gaëtan
• The Power and Limitations of Static Binary Search Trees with Lazy Finger
  Bose, Prosenjit ; Douïeb, Karim ; Iacono, John ; Langerman, Stefan
• On the Computational Complexity of Vertex Integrity and Component Order Connectivity
  Drange, Pål Grønås ; Dregi, Markus ; van ’t Hof, Pim
• A Short Implicant of a CNF Formula with Many Satisfying Assignments
  Kane, Daniel ; Watanabe, Osamu
• A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
  Cheilaris, Panagiotis ; Khramtcova, Elena ; Langerman, Stefan ; Papadopoulou, Evanthia
• A Randomized $$\mathrm {O}(\log n)$$ O ( log n ) -Competitive Algorithm for the Online Connected Facility Location Problem
  San Felice, Mário César ; Williamson, David P. ; Lee, Orlando
• Conjugacy in Baumslag’s Group, Generic Case Complexity, and Division in Power Circuits
  Diekert, Volker ; Myasnikov, Alexei G. ; Weiß, Armin
• Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability
  Genitrini, Antoine ; Mailler, Cécile
• An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution
  Ando, Ei ; Kijima, Shuji
• Diffuse Reflection Radius in a Simple Polygon
  Fox-Epstein, Eli ; Tóth, Csaba D. ; Winslow, Andrew
• On Kernelization and Approximation for the Vector Connectivity Problem
  Kratsch, Stefan ; Sorge, Manuel
• A thirty Year old conjecture about promise problems
  Hughes, Andrew ; Mandal, Debasis ; Pavan, A. ; Russell, Nathan ; Selman, Alan L.
• Affine extractors over large fields with exponential error
  Bourgain, Jean ; Dvir, Zeev ; Leeman, Ethan
• Testing list H-homomorphisms
  Yoshida, Yuichi
• The complexity of intersecting finite automata having few final states
  Blondin, Michael ; Krebs, Andreas ; McKenzie, Pierre
• Induced Minor Free Graphs: Isomorphism and Clique-Width
  Belmonte, Rémy ; Otachi, Yota ; Schweitzer, Pascal