„subexponential algorithms“

Suchergebnisse

39 Treffer

• Parameterized Study of Steiner Tree on Unit Disk Graphs
  Bhore, Sujoy ; Carmi, Paz ; Kolay, Sudeshna ; Zehavi, Meirav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
  Fomin, Fedor V. ; Golovach, Petr A.
• Fast Biclustering by Dual Parameterization
  Drange, Pål Grønås ; Reidl, Felix ; Sanchez Villaamil, Fernando ; Sikdar, Somnath 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms
  Bacsó, Gábor ; Marx, Dániel ; Tuza, Zsolt 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Time Algorithms for Embedding H-Minor Free Graphs
  Bodlaender, Hans L. ; Nederlof, Jesper ; van der Zanden, Tom C. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
  Marx, Dániel ; Miltzow, Tillmann 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
  Fomin, Fedor ; Kolay, Sudeshna ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bidimensionality and Parameterized Algorithms (Invited Talk)
  Thilikos, Dimitrios M. 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
  Lokshtanov, Daniel ; Saurabh, Saket ; Wahlström, Magnus 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Constructing elliptic curve isogenies in quantum subexponential time
  Childs, Andrew ; Jao, David ; Soukharev, Vladimir
• A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
  Jao, David ; LeGrow, Jason ; Leonardi, Christopher ; Ruiz-Lopez, Luis
• A subexponential bound for linear programming
  Matoušek, J. ; Sharir, M. ; Welzl, E.
• BPP has subexponential time simulations unlessEXPTIME has publishable proofs
  Babai, Lźszló ; Fortnow, Lance ; Nisan, Noam ; Wigderson, Avi
• The searching over separators strategy to solve some NP-hard problems in subexponential time
  Hwang, R. Z. ; Chang, R. C. ; Lee, R. C. T.
• Counting connected components of a semialgebraic set in subexponential time
  Grigor'ev, D. Yu ; Vorobjov, N. N.
• Counting Cycles on Planar Graphs in Subexponential Time
  Cai, Jin-Yi ; Maran, Ashwin
• Subexponential-Time Algorithms for Sparse PCA
  Ding, Yunzi ; Kunisky, Dmitriy ; Wein, Alexander S. ; Bandeira, Afonso S.
• On Subexponential and FPT-Time Inapproximability
  Bonnet, Edouard ; Escoffier, Bruno ; Kim, Eun Jung ; Paschos, Vangelis Th
• Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas
  Oliveira, Rafael ; Shpilka, Amir ; Volk, Ben lee