78 search results - page 10 / 16 » Unsatisfiable Systems of Equations, Over a Finite Field |
SIGMETRICS
2010
ACM
14 years 8 days ago
2010
ACM
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
CP
1999
Springer
13 years 11 months ago
1999
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
IJNSEC
2010
13 years 2 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
SIAMREV
2010
13 years 2 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
FCSC
2007
13 years 7 months ago
2007
The aim of mathematics mechanization is to develop symbolic algorithms for manipulating mathematical objects, proving and discovering theorems in a mechanical way. This paper gives...