We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
—A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to...