Results 11  20
of
346
A discrete subexponential algorithm for parity games
 STACS’03
, 2003
"... We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly ..."
Abstract

Cited by 36 (8 self)
 Add to MetaCart
We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly
Combinatorial structure and randomized subexponential algorithms for infinite games
, 2005
"... ..."
A Randomized Subexponential Algorithm for Parity Games
 Nordic Journal of Computing
, 2001
"... We describe a randomized algorithm for Parity Games (equivalent ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We describe a randomized algorithm for Parity Games (equivalent
A subexponential algorithm for trivalent graph isomorphism
"... The best of the known algorithms for testing isomorphism of general undirected graphs have running times exponential in n. the number of vertices. To increase the efficiency of testing isomorphism. heuristics are often used. Typically, these heuristics partition the vertices into classes with given ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
vertices have been partitioned into classes of size k or less, for some fixed k. He was able to exhibit a polynomialtime Las Vegas algorithms i.e. an algorithm in R n colt to solve this problem. He also observed that no subexponential deterministic algorithm was known. Our first result provides a
A Subexponential Algorithm for Evaluating Large Degree Isogenies
, 1002
"... Abstract. An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same endomorphism ring, the previous best known algorithm h ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same endomorphism ring, the previous best known algorithm
Fast subexponential algorithm for nonlocal problems on graphs of bounded genus, in
 Proc. of the 10th Scandinavian Workshop on Algorithm Theory, SWAT, in: LNCS
"... Abstract We give a general technique for designing fast subexponential algorithms for several graph problems whose instances are restricted to graphs of bounded genus. We use it to obtain time 2 O( √ n) algorithms for a wide family of problems such as Hamiltonian Cycle, Σembedded Graph Travelling ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
Abstract We give a general technique for designing fast subexponential algorithms for several graph problems whose instances are restricted to graphs of bounded genus. We use it to obtain time 2 O( √ n) algorithms for a wide family of problems such as Hamiltonian Cycle, Σembedded Graph Travelling
A Subexponential Algorithm for the Determination of Class Groups and Regulators of Algebraic Number Fields
, 1990
"... A new probabilistic algorithm for the determination of class groups and regulators of an algebraic number field F is presented. Heuristic evidence is given which shows that the expected running time of the algorithm is exp( p log D log log D) c+o(1) where D is the absolute discriminant of F , wh ..."
Abstract

Cited by 59 (5 self)
 Add to MetaCart
A new probabilistic algorithm for the determination of class groups and regulators of an algebraic number field F is presented. Heuristic evidence is given which shows that the expected running time of the algorithm is exp( p log D log log D) c+o(1) where D is the absolute discriminant of F
New Subexponential Algorithms for Factoring in SL(2,F2 n)
"... Cayley hash functions are a particular kind of cryptographic hash functions with very appealing properties. Unfortunately, their security is related to a mathematical problem whose hardness is not very well understood, the factorization problem in finite groups. Given a group G, a set of generators ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
kind of multivariate equation over F2n. Then, we introduce a dedicated approach to solve this equation with Gröbner bases. We provide a complexity analysis of our approach that is of independent interest from the point of view of Gröbner basis algorithms. Finally, we give the first subexponential time
Sphere Cut Branch Decomposition: Subexponential Algorithms on Planar Graphs
, 2005
"... Divideandconquer strategy based on variations of LiptonTarjan planar separator theorem is one of the most common approaches for solving planar graph problems for more than 20 years. We present a new framework for designing fast subexponential exact and parameterized algorithms on planar graphs. ..."
Abstract
 Add to MetaCart
Divideandconquer strategy based on variations of LiptonTarjan planar separator theorem is one of the most common approaches for solving planar graph problems for more than 20 years. We present a new framework for designing fast subexponential exact and parameterized algorithms on planar graphs
Subexponential Algorithms for dto1 TwoProver Games and for Certifying Almost Perfect Expansion
, 2010
"... A question raised by the recent subexponential algorithm for Unique Games (Arora, Barak, Steurer, FOCS 2010) is what other “hardlooking ” problems admit good approximation algorithms with subexponential complexity. In this work, we give such an algorithm for dto1 twoprover games, a broad class o ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
A question raised by the recent subexponential algorithm for Unique Games (Arora, Barak, Steurer, FOCS 2010) is what other “hardlooking ” problems admit good approximation algorithms with subexponential complexity. In this work, we give such an algorithm for dto1 twoprover games, a broad class
Results 11  20
of
346