9842 search results - page 455 / 1969 » The Complexity of the Matching-Cut Problem |
184
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we present a deeper analysis than has previously been carried out of a selective attention problem, and the evolution of continuous-time recurrent neural networks to...
181
click to vote
IJAR
2006
15 years 7 months ago
2006
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
160
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
156
click to vote
IPL
2006
15 years 7 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
198
click to vote
TCS
2008
15 years 7 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...