4047 search results - page 129 / 810 » The Discrete Basis Problem |
84
Voted
DGCI
2006
Springer
15 years 4 months ago
2006
Springer
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
94
Voted
WCC
2005
Springer
15 years 6 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
111
Voted
MOC
2002
15 years 12 days ago
2002
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
80
Voted
DM
2008
15 years 24 days ago
2008
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
70
Voted
MOC
2000
15 years 15 days ago
2000
In this paper, we consider iterative algorithms of Uzawa type for solving linear nonsymmetric saddle point problems. Specifically, we consider systems, written as usual in block fo...