29908 search results - page 48 / 5982 » On the Complexity of |
GECCO
2003
Springer
14 years 28 days ago
2003
Springer
Abstract. This paper presents a novel perspective to the use of multiobjective optimization and in particular evolutionary multi-objective optimization (EMO) as a measure of comple...
ICLP
2001
Springer
14 years 5 days ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
ASIACRYPT
1999
Springer
14 years 7 hour ago
1999
Springer
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...