„Matrix multiplication“

Suchergebnisse

247 Treffer

• On Algebraic Branching Programs of Small Width
  Bringmann, Karl ; Ikenmeyer, Christian ; Zuiddam, Jeroen 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
  AbouEisha, Hassan ; Amin, Talha ; Chikalov, Igor ; Hussain, Shahid ; Moshkov, Mikhail Ju. 2019 Springer International Publishing
• Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication
  Buhrman, Harry ; Christandl, Matthias ; Zuiddam, Jeroen 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• RNA-Folding - From Hardness to Algorithms (Invited Talk)
  Vassilevska Williams, Virginia 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Parameterized Algorithms for APSP in Directed Graphs
  Porat, Ely ; Shahbazian, Eduard ; Tov, Roei 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• How Hard is it to Find (Honest) Witnesses?
  Goldstein, Isaac ; Kopelowitz, Tsvi ; Lewenstein, Moshe ; Porat, Ely 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Optimal Approximate Matrix Product in Terms of Stable Rank
  Cohen, Michael B. ; Nelson, Jelani ; Woodruff, David P. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Entropy Games and Matrix Multiplication Games
  Asarin, Eugene ; Cervelle, Julien ; Degorre, Aldric ; Dima, Catalin ; Horn, Florian ; Kozyakin, Victor 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Depth-Five Lower Bound for Iterated Matrix Multiplication
  Bera, Suman K. ; Chakrabarti, Amit 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
  Fu, Hu ; Kleinberg, Robert 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Deterministic algorithms for skewed matrix products
  Kutzkov, Konstantin 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dynamic matrix rank with partial lookahead
  Kavitha, Telikepalli 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Numerical Simulation of a Photonic Tensor Core for the Hardware Acceleration of the Optical Matrix–Vector Multiplication
  Kolosov, G. A. ; Shorokhov, A. S. ; Fedyanin, A. A.
• Reprogrammable, In‐Materia Matrix‐Vector Multiplication with Floppy Modes
  Louvet, Theophile ; Omidvar, Parisa ; Serra‐Garcia, Marc
• Free‐space Optical Computing Systems
  Chen, Ruiyang ; Gao, Weilu
• Extension of accurate numerical algorithms for matrix multiplication based on error-free transformation
  Ozaki, Katsuhisa ; Mukunoki, Daichi ; Ogita, Takeshi
• Fast Matrix Multiplication with Applications
  Respondek, Jerzy S. 2025 Springer Nature Switzerland, Imprint: Springer
• Computational Linear and Commutative Algebra
  Kreuzer, Martin ; Robbiano, Lorenzo 2016 Springer International Publishing
• Implicit matrix multiplication with maximum accuracy on various transputer networks
  Bohlender, G. ; Kersten, T. ; Trier, R.
• Experience-guided, mixed-precision matrix multiplication with apache TVM for ARM processors
  Castelló, Adrián ; Martínez, Héctor ; Catalán, Sandra ; Igual, Francisco D. ; Quintana-Ortí, Enrique S.