Randomized Algorithms over Finite Fields for the Exact Parity Base Problem

Abstract We present three randomized pseudo-polynomial algorithms for the problem of finding a base of specified value in a weighted represented matroid subject to parity conditions. These algorithms, the first two being an improved version of those presented by P. M. Camerini et al. (1992, J. Algorithms13, 258–273) use fast arithmetic working over a finite field chosen at random among a set of appropriate fields. We show that the choice of a best algorithm among those presented depends on a conjecture related to the best value of the so-called Linnik constant concerning the distribution of prime numbers in arithmetic progressions. This conjecture, which we call the C-conjecture, is a strengthened version of a conjecture formulated in 1934 by S. Chowla. If the C-conjecture is true, the choice of a best algorithm is simple, since the last algorithm exhibits the best performance, either when the performance is measured in arithmetic operations, or when it is measured in bit operations and mild assumptions hold. If the C-conjecture is false we are still able to identify a best algorithm, but in this case the choice is between the first two algorithms and depends on the asymptotic growth of m with respect to those of U and n, where 2n, 2m, U are the rank, the number of elements, and the maximum weight assigned to the elements of the matroid, respectively.

[1]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[2]  D. R. Heath-Brown.  Zero-free regions for Dirichlet $L$-functions, and the least prime in an arithmetic progression , 1992 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Francesco Maffioli,et al.  on the Computation of Pfaffians , 1994, Discret. Appl. Math..

[5]  Komaravolu Chandrasekharan,et al.  Introduction to Analytic Number Theory , 1969 .

[6]  Leonard M. Adleman,et al.  On distinguishing prime numbers from composite numbers , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[7]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[8]  Y. Linnik,et al.  On prime numbers in an arithmetic progression with a prime-power difference , 1964 .

[9]  L. Adleman,et al.  On distinguishing prime numbers from composite numbers , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[11]  Chen Jing-Run,et al.  ON THE LEAST PRIME IN AN ARITH-METICAL PROGRESSION (IV) , 1989 .

[12]  William R. Pulleyblank,et al.  Exact arborescences, matchings and cycles , 1987, Discret. Appl. Math..

[13]  Jingrun Chen,et al.  On the Least Prime in an Arithmetical Progression and Theorems Concerning the Zeros of Dirichlet’s L -Functions ( V ) , 1991 .

[14]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[15]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[16]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[17]  R. McEliece.  Finite Fields for Computer Scientists and Engineers , 1986 .

[18]  Francesco Maffioli,et al.  Random Pseudo-Polynomial Algorithms for Exact Matroid Problems , 1992, J. Algorithms.