Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 2011 Copyright 2011 Universität Bonn, Institut für Informatik, Abt. V
85320

04.04.2011

A Conjecture about Homogeneous and Antisymmetric m-Schemes
Manuel Arora
[Download PostScript] [Download PDF]

We study the notion of matchings in homogeneous and antisymmetric m-schemes, as defined in Ivanyos, Karpinski & Saxena (2009). We give a general conjecture which involves the existence of matchings in homogeneous and antisymmetric m-schemes and prove certain special cases of it. Our results, as part of the general topic of matchings in m-schemes, are closely related to the deterministic time complexity of polynomial factoring over finite fields.

Last Change: 04/04/11 at 14:39:25
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope