Suchergebnisse - Subexponential algorithm

Subexponential-Time Algorithms for Maximum Independent Set in P t -Free and Broom-Free Graphs von Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan

“… ). Here we study the existence of subexponential-time algorithms for the problem: we show that for any …”
Volltext

A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs von Brause, Christoph

“… In this paper we present a subexponential algorithm for the Maximum (Weighted) Independent Set Problem in Pt-free graphs …”
Volltext

FPT approximation and subexponential algorithms for covering few or many edges von Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Koana, Tomohiro

“… We study the α-Fixed Cardinality Graph Partitioning (α-FCGP) problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica …”
Volltext

A heuristic subexponential algorithm to find paths in Markoff graphs over finite fields von Silverman, Joseph H.

“… Charles et al  (J Cryptol 22(1):93–113, 2009) explained how one can construct hash functions using expander graphs in which it is hard to find paths between …”
Volltext

Subexponential algorithms for partial cover problems von Fomin, Fedor V., Lokshtanov, Daniel, Raman, Venkatesh, Saurabh, Saket

“… Partial Cover problems are optimization versions of fundamental and well-studied problems like Vertex Cover and Dominating Set. Here one is interested in …”
Volltext

Subexponential-Time Algorithms for Sparse PCA von Ding, Yunzi, Kunisky, Dmitriy, Wein, Alexander S., Bandeira, Afonso S.

“… We study the computational cost of recovering a unit-norm sparse principal component x ∈ R n planted in a random matrix, in either the Wigner or Wishart spiked …”
Volltext

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs von Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan

Volltext

Subexponential Parameterized Algorithm for Minimum Fill-In von Fomin, Fedor V., Villanger, Yngve

“… Here, we give the first subexponential parameterized algorithm solving Minimum Fill-in in time $\mathcal{O}(2^{\mathcal{O}(\sqrt{k}\log{k})} +k^2 nm …”
Volltext

A Deterministic Subexponential Algorithm for Solving Parity Games von Jurdziński, Marcin, Paterson, Mike, Zwick, Uri

“… The fastest known algorithms for the problem are randomized algorithms that run in subexponential time …”
Volltext

Simulating Quantum Circuits Using Efficient Tensor Network Contraction Algorithms with Subexponential Upper Bound von Wahl, Thorsten B., Strelchuk, Sergii

“… Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be classically simulated in subexponential time in the number of gates …”
Volltext

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs von Dorn, Frederic, Fomin, Fedor V., Lokshtanov, Daniel, Raman, Venkatesh, Saurabh, Saket

“… In this paper we make the first step beyond bidimensionality by obtaining subexponential time algorithms for problems on directed graphs …”
Volltext

Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs von Fomin, Fedor V., Golovach, Petr A.

“… k . It appears that a number of fundamental intractable optimization problems being parameterized by k admit subexponential algorithms on graphs from C H O R D A L - k e …”
Volltext

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs von Novotná, Jana, Okrasa, Karolina, Pilipczuk, Michał, Rzążewski, Paweł, van Leeuwen, Erik Jan, Walczak, Bartosz

“… ; and the considered problem admits a single-exponential fixed-parameter algorithm when parameterized by the treewidth of the input graph …”
Volltext

On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs von Marx, Daniel, Pilipczuk, Marcin, Pilipczuk, Michal

“… There are numerous examples of the so-called "square root phenomenon" in the field of parameterized algorithms …”
Volltext

A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over GF( q) von Adleman, Leonard M., DeMarrais, Jonathan, Huang, Ming-Deh

“… There are well-known subexponential algorithms for finding discrete logarithms over finite fields …”
Volltext

Combinatorial structure and randomized subexponential algorithms for infinite games von Björklund, Henrik, Vorobyov, Sergei

“… In this setting, we suggest randomized subexponential algorithms appropriate for RLG- and PRLG-function optimization …”
Volltext

A subexponential-time algorithm for the Maximum Independent Set Problem in P^sub t^-free graphs von Brause, Christoph

“… In this paper we present a subexponential algorithm for the Maximum (Weighted) Independent Set Problem in Pt-free graphs …”
Volltext

Subexponential parameterized algorithms von Dorn, Frederic, Fomin, Fedor V., Thilikos, Dimitrios M.

“… We give a review of a series of techniques and results on the design of subexponential parameterized algorithms for graph problems …”
Volltext

Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs von Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan

“… ). Here we study the existence of subexponential-time algorithms for the problem: we show that for any …”
Volltext

On the existence of subexponential parameterized algorithms von Cai, Liming, Juedes, David

“… The existence of subexponential-time parameterized algorithms is examined for various parameterized problems solvable in time O(2 O( k) p( n …”
Volltext