Sciweavers

ISSAC
2009
Springer
123views Mathematics» more  ISSAC 2009»
15 years 3 months ago
Schemes for deterministic polynomial factoring
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...