281 search results - page 35 / 57 » The Proof Complexity of Linear Algebra |
ISSAC
1997
Springer
14 years 4 days ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
STTT
2011
13 years 2 months ago
2011
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). Our improvements target the numerical components of the tradit...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
ARCS
2008
Springer
13 years 10 months ago
2008
Springer
: The architecture of the IBM Cell BE processor represents a new approach for designing CPUs. The fast execution of legacy software has to stand back in order to achieve very high ...