Search Results - Subexponential algorithm

Subexponential-Time Algorithms for Maximum Independent Set in P t -Free and Broom-Free Graphs by 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…”
Get full text

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

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

FPT approximation and subexponential algorithms for covering few or many edges by 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…”
Get full text

A heuristic subexponential algorithm to find paths in Markoff graphs over finite fields by 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…”
Get full text

Subexponential algorithms for partial cover problems by 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…”
Get full text

Subexponential-Time Algorithms for Sparse PCA by 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…”
Get full text

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

Get full text

Subexponential Parameterized Algorithm for Minimum Fill-In by 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…”
Get full text

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

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

Simulating Quantum Circuits Using Efficient Tensor Network Contraction Algorithms with Subexponential Upper Bound by 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…”
Get full text

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs by 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…”
Get full text

Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs by 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…”
Get full text

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs by 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…”
Get full text

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

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

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

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

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

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

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

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

Subexponential parameterized algorithms by 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…”
Get full text

Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs by 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…”
Get full text

On the existence of subexponential parameterized algorithms by 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…”
Get full text