Kannan, R and Venkateswaran, H and Vinay, V and Yao, AC (1993) A Circuit-Based Proof of Toda′s Theorem. In: Information and Computation, 104 (2). pp. 271-276.
Circuit.pdf - Published Version
Restricted to Registered users only
Download (257Kb) | Request a copy
We present a simple proof of Toda′s result (Toda (1989), in "Proceedings, 30th Annual IEEE Symposium on Foundations of Computer Science," pp. 514-519), which states that circled plus P is hard for the Polynomial Hierarchy under randomized reductions. Our approach is circuit-based in the sense that we start with uniform circuit definitions of the Polynomial Hierarchy and apply the Valiant-Vazirani lemma on these circuits (Valiant and Vazirani (1986), Thoeret. Comput. Sci.47, 85-93).
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier Science.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||31 Jan 2011 13:31|
|Last Modified:||31 Jan 2011 13:31|
Actions (login required)