Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity
Research reports, surveys and books in computational complexity

Account | Logout | Modern Style


ECCC > REPORTS > KEYWORD > COUNTING LOGSPACE CLASSES:
Reports tagged with counting logspace classes:
TR02-016 | 30th January 2002
Alina Beygelzimer, Mitsunori Ogihara

On the Enumerability of the Determinant and the Rank

We investigate the complexity of enumerative approximation of
two elementary problems in linear algebra, computing the rank
and the determinant of a matrix. In particular, we show that
if there exists an enumerator that, given a matrix, outputs a
list of constantly many numbers, one of which is guaranteed to
more >>>



ISSN 1433-8092 | Imprint