Sciweavers

42 search results - page 7 / 9
» jsc 2010
Sort
View
JSC
2010
90views more  JSC 2010»
13 years 4 months ago
Modular Las Vegas algorithms for polynomial absolute factorization
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
Cristina Bertone, Guillaume Chèze, Andr&eac...
JSC
2010
107views more  JSC 2010»
13 years 4 months ago
Solving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of e...
Volker Gebhardt, Juan González-Meneses
JSC
2010
63views more  JSC 2010»
13 years 4 months ago
Normalization of rings
We present a new algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. A modification, applicable in positive characteristic, whe...
Gert-Martin Greuel, Santiago Laplagne, Frank Seeli...
JSC
2010
82views more  JSC 2010»
13 years 17 days ago
The first rational Chebyshev knots
A Chebyshev knot C(a, b, c, ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + ), where a, b, c are integers, Tn(t) is the Chebyshev pol...
Pierre-Vincent Koseleff, D. Pecker, F. Rouillier
JSC
2010
135views more  JSC 2010»
13 years 4 months ago
Deciding inseparability and conservative extensions in the description logic EL
We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is...
Carsten Lutz, Frank Wolter