„polynomial algorithms“

Suchergebnisse

1.000+ Treffer

• A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
  Madathil, Jayakrishnan ; Sharma, Roohani ; Zehavi, Meirav
• Computing the roots of sparse high–degree polynomials that arise from the study of random simplicial complexes
  Farouki, Rida T. ; Strom, Jeffrey A.
• Correction to: Sub-range Jacobi polynomials
  Gautschi, Walter
• Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
  Yang, Zhao ; Huang, Rong ; Zhu, Wei
• Solving Polynomial Equations – Foundations, Algorithms, and Applications
  Dickenstein, Alicia 2005 Springer Berlin Heidelberg
• Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix
  Reif, J. H.
• Polynomial-Time Decomposition Algorithms for Support Vector Machines
  Hush, Don ; Scovel, Clint
• Combinatorial Optimization and Graph Algorithms – Communications of NII Shonan Meetings
  Fukunaga, Takuro ; Kawarabayashi, Ken-ichi 2017 Springer Singapore
• Asymptotics for Szegö polynomial zeros
  Jones, William B. ; Njåstad, Olav ; Waadeland, Haakon
• Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension
  Jee, Hyejung H. ; Sparaciari, Carlo ; Fawzi, Omar ; Berta, Mario 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computational Methods in Physics – Compendium for Students
  Širca, Simon ; Horvat, Martin 2025 Springer Nature Switzerland, Imprint: Springer
• Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
  Bentert, Matthias ; Heeger, Klaus ; Koana, Tomohiro 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The CMV bispectrality of the Jacobi polynomials on the unit circle
  Vinet, Luc ; Zhedanov, Alexei
• Efficient Algorithms to Decide Tightness
  Bagchi, Bhaskar ; Datta, Basudeb ; Burton, Benjamin A. ; Singh, Nitin ; Spreer, Jonathan 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Perfect Forests in Graphs and Their Extensions
  Gutin, Gregory Z. ; Yeo, Anders 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computational Methods in Physics – Compendium for Students
  Širca, Simon ; Horvat, Martin 2018 Springer International Publishing
• Computational Methods for Physicists – Compendium for Students
  Širca, Simon ; Horvat, Martin 2012 Springer Berlin Heidelberg
• ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space
  Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay ; Saurabh, Saket 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem
  Lokshtanov, Daniel ; de Oliveira Oliveira, Mateus ; Saurabh, Saket 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Novel Strong Decorrelation Approach for Image Subband Coding Using Polynomial EVD Algorithms
  Yepuganti, Karuna ; Reddy, G. Ramachandra