Vinay, V (1991) Is BP.(+)P a probabilistic class? In: Foundations of Software Technology and Theoretical Computer Science, 17-19 Dec. 1991, New Delhi, India, pp. 261-265.
Full text not available from this repository. (Request a copy)
Official URL: http://www.springerlink.com/content/7k4826l7667k81...
Abstract
The author shows a uniform circuit characterization of BP.⊕𝒫 without using probabilistic bits. The proof of the result is extremely simple, yet unknown. To the best of the author's knowledge, these observations have not been made before. The class BP.⊕𝒫 has received much attention, especially after Toda (1989) showed that it contains the whole of the polynomial hierarchy. Toda's result is an extension of a key result of Valiant and Vazirani [VV 86]
| Item Type: | Conference Paper |
|---|---|
| Publisher: | Springer-Verlag |
| Additional Information: | Copyright of this article belongs to Springer-Verlag. |
| Keywords: | computational complexity;probability |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 24 Jan 2008 |
| Last Modified: | 12 Jan 2012 09:24 |
| URI: | http://eprints.iisc.ac.in/id/eprint/11197 |
Actions (login required)
 |
View Item |
