„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Polynomial Cases for the Vertex Coloring Problem
  Karthick, T. ; Maffray, Frédéric ; Pastor, Lucas
• The Fast Search Number of a Complete k-Partite Graph
  Xue, Yuan ; Yang, Boting ; Zhong, Farong ; Zilles, Sandra
• Präzises Denken für Informatiker
  Wolf, Karsten 2017 Springer Vieweg
• Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median
  Behsaz, Babak ; Friggstad, Zachary ; Salavatipour, Mohammad R. ; Sivakumar, Rohit
• A hybrid fuzzy-PID controller based on gray wolf optimization algorithm in power system
  Ghanamijaber, Mobin
• Analytic hierarchy process based approximation of high-order continuous systems using TLBO algorithm
  Singh, S. P. ; Singh, Varsha ; Singh, V. P.
• General Caching Is Hard: Even with Small Pages
  Folwarczný, Lukáš ; Sgall, Jiří
• Reduced Complexity Channel Tracking Algorithm for UMTS-FDD Mobile Phones
  2018 Prior Art Publishing GmbH
• Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits
  Pandey, Anurag ; Saxena, Nitin ; Sinhababu, Amit
• Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
  Liedloff, Mathieu ; Montealegre, Pedro ; Todinca, Ioan
• Nichtsequentielle und Verteilte Programmierung mit Go – Synchronisation nebenläufiger Prozesse: Kommunikation – Kooperation – Konkurrenz
  Maurer, Christian 2018 Springer Fachmedien Wiesbaden
• Nichtsequentielle und Verteilte Programmierung mit Go – Synchronisation nebenläufiger Prozesse: Kommunikation - Kooperation - Konkurrenz
  Maurer, Christian 2018 Springer Vieweg
• An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face
  Bentz, Cédric
• Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases
  Weller, Mathias ; Chateau, Annie ; Dallard, Clément ; Giroudeau, Rodolphe
• Lift-and-Project Methods for Set Cover and Knapsack
  Chlamtáč, Eden ; Friggstad, Zachary ; Georgiou, Konstantinos
• Algorithmic complexity of quantum capacity
  Oskouei, Samad Khabbazi ; Mancini, Stefano
• Constructive non-commutative rank computation is in deterministic polynomial time
  Ivanyos, Gábor ; Qiao, Youming ; Subrahmanyam, K. V.
• Tensor surgery and tensor rank
  Christandl, Matthias ; Zuiddam, Jeroen
• Cutwidth: Obstructions and Algorithmic Aspects
  Giannopoulou, Archontia C. ; Pilipczuk, Michał ; Raymond, Jean-Florent ; Thilikos, Dimitrios M. ; Wrochna, Marcin
• Two Bilinear (3 × 3)-Matrix Multiplication Algorithms of Complexity 25
  Chokaev, B. V. ; Shumkin, G. N.