9842 search results - page 203 / 1969 » Problem complexity |
118
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
115
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
129
Voted
E4MAS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Even if the multi-agent paradigm has been evolving for fifteen years, the development of concrete methods for problem solving remains a major challenge. This paper focus...
106
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
101
click to vote
ISSAC
2004
Springer
15 years 8 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...