199 search results - page 22 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents the Pareto Calculator, a tool for compositional computation of Pareto points, based on the algebra of Pareto points. The tool is a useful instrument for multidi...
PARA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...