Randomized Algorithms over Finite Fields for the Exact Parity Base Problem

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,...

Full description

Bibliographic Details

Published in:	Journal of Complexity Vol. 15; no. 4; pp. 537 - 556
Main Authors:	Galbiati, Giulia, Maffioli, Francesco, Viola, Carlo
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.12.1999
Subjects:	exact problems matroids randomized algorithms exact problems matroids randomized algorithms
ISSN:	0885-064X, 1090-2708
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!