Sciweavers

790 search results - page 58 / 158
» Subexponential Parameterized Algorithms
Sort
View
ISAAC
2004
Springer
142views Algorithms» more  ISAAC 2004»
15 years 8 months ago
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
Qi Cheng, Ming-Deh A. Huang
CORR
2008
Springer
117views Education» more  CORR 2008»
15 years 1 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan
ICCAD
1998
IEEE
90views Hardware» more  ICCAD 1998»
15 years 7 months ago
Technology mapping for domino logic
Domino logic is a popular con guration for implementing high-speed circuits. An algorithm for domino logic mapping, under a parameterized library style, is presented here. Practic...
Min Zhao, Sachin S. Sapatnekar
ESA
2009
Springer
159views Algorithms» more  ESA 2009»
15 years 9 months ago
Contraction Bidimensionality: The Accurate Picture
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
MICS
2010
77views more  MICS 2010»
15 years 1 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
George B. Mertzios, Walter Unger