Sciweavers

790 search results - page 5 / 158
» Subexponential Parameterized Algorithms
Sort
View
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 10 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
CORR
2010
Springer
192views Education» more  CORR 2010»
13 years 7 months ago
Constructing elliptic curve isogenies in quantum subexponential time
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...
Andrew M. Childs, David Jao, Vladimir Soukharev
MOC
2002
121views more  MOC 2002»
13 years 9 months ago
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
Andreas Enge
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
14 years 1 months ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
STOC
2009
ACM
224views Algorithms» more  STOC 2009»
14 years 10 months ago
3-query locally decodable codes of subexponential length
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
Klim Efremenko