Berkowitz algorithm provides a polynomial size circuit with logarithmic depth for determinant of a square matrix using matrix powers.
Is there a polynomial size boolean circuit for $i$th bit of determinant and is it still logarithmic depth?
$\begingroup$
$\endgroup$
2
-
$\begingroup$ Can you provide some references to your question? $\endgroup$– loxCommented Jun 22, 2019 at 9:57
-
$\begingroup$ cstheory.stackexchange.com/questions/17501/…. $\endgroup$– TurboCommented Jun 22, 2019 at 9:58
Add a comment
|