451 search results - page 33 / 91 » On Parameterized Exponential Time Complexity |
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
CP
2007
Springer
14 years 4 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
ICCAD
2002
IEEE
14 years 6 months ago
2002
IEEE
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
ASP
2005
Springer
14 years 3 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
EUROCRYPT
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...