computational complexity

, Volume 7, Issue 2, pp 128–151 | Cite as

Verifying the determinant in parallel

  • M. Santha
  • S. Tan


In this paper, we investigate the complexity of verifying problems whose computation is equivalent to the determinant, both in the Boolean arithmetic circuit and in the Boolean circuit model. We observe that for a few problems, there exists an easy (NC 1) verification algorithm. To characterize the harder ones, we define the class of problems that are reducible to the verification of the determinant, under two different reductions, and establish a list of complete problems in these classes. In particular, we prove that computing the rank is equivalent under AC 0 reductions to verifying the determinant. We show in the Boolean case that none of the complete problems can be recognized in NC 1 unless L = NL. On the other hand, we show that for functions, there exists an NC 1 checker even if they are hard to verify, and that they can be extended into functions whose verification is easy.

Key words. Parallel computing; complexity classes; verification; program checking; linear algebra. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Verlag, Basel, 1998

Authors and Affiliations

  • M. Santha
    • 1
  • S. Tan
    • 2
  1. 1.CNRS, URA 410, Université Paris-Sud, 91405 Orsay, France, santha@lri.frFR
  2. 2.Univ. Paris XII-Val de Marne, 61, av. du Général de Gaulle, 94 010 Créteil Cedex, France, sovanna@univ-paris12.frFR

Personalised recommendations