Verifying the determinant in parallel

DOI10.1007/PL00001596zbMath0912.68053OpenAlexW2037525401MaRDI QIDQ1272660

Miklos Santha, Sovanna Tan

Publication date: 18 May 1999

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00001596

zbMATH Keywords

Boolean arithmetic circuitBoolean circuit model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

The complexity of the characteristic and the minimal polynomial. ⋮ Isolation, matching, and counting uniform and nonuniform upper bounds ⋮ ON THE MINIMAL POLYNOMIAL OF A MATRIX ⋮ On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits

This page was built for publication: Verifying the determinant in parallel