Sciweavers

425 search results - page 16 / 85
» Polynomial Factorization 1987-1991
Sort
View
JSC
2006
85views more  JSC 2006»
13 years 7 months ago
Fraction-free row reduction of matrices of Ore polynomials
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspa...
Bernhard Beckermann, Howard Cheng, George Labahn
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
ASIACRYPT
2008
Springer
13 years 9 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
ARSCOM
2004
75views more  ARSCOM 2004»
13 years 7 months ago
On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
Stefan Szeider
EJC
2011
12 years 11 months ago
A Tutte-style proof of Brylawski's tensor product formula
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
Yuanan Diao, Gábor Hetyei, Kenneth Hinson