Sciweavers

76 search results - page 3 / 16
» Testing Polynomials over General Fields
Sort
View
AISC
2008
Springer
13 years 9 months ago
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
Amine Chaieb
IROS
2009
IEEE
131views Robotics» more  IROS 2009»
14 years 2 months ago
A Multi-Element generalized Polynomial Chaos approach to analysis of mobile robot dynamics under uncertainty
— The ability of mobile robots to quickly and accurately analyze their dynamics is critical to their safety and efficient operation. In field conditions, significant uncertainty ...
Gaurav Kewlani, Karl Iagnemma
AAECC
1997
Springer
115views Algorithms» more  AAECC 1997»
13 years 11 months ago
Efficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...
Laurent Bernardin, Michael B. Monagan
JSC
2010
155views more  JSC 2010»
13 years 5 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 7 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer