Abstract: We extend Nisan's breakthrough derandomization result that BP H L sube SC 2 (1992) to bounded error probabilistic complexity classes based on ...

In this paper, we extend Nisan's breakthrough derandomization result that BPH L ⊆ SC2 [11] to bounded error probabilistic complexity classes based on ...

We extend Nisan's breakthrough derandomization result that. [11] to bounded error probabilistic complexity classes based on auxiliary pushdown automata.

We also present a simple circuit-based proof that BP_HLOGCFL is in NC^2. Derandomization of Probabilistic Auxiliary Pushdown Automata ClassesH.

Derandomization of probabilistic auxiliary pushdown automata classes. January 2006; Proceedings of the Annual IEEE Conference on Computational Complexity 2006 ...

Derandomization of Probabilistic Auxiliary Pushdown Automata Classes. 2009 ... classes, and methods that contribute to that exception-handling construct.

H. Venkateswaran's 36 research works with 587 citations, including: Derandomization of probabilistic auxiliary pushdown automata classes.

Derandomization of probabilistic auxiliary pushdown automata classes · H. Venkateswaran. Computer Science, Mathematics. 21st Annual IEEE Conference on ...

Venkateswaran: Derandomization of probabilistic auxiliary pushdown automata classes. In Proc. 21st IEEE Conf. on Computational Complexity (CCC'06), pp. 355 ...

Derandomization is the study of how to replace probabilistic algorithms by efficient deterministic algorithms. It has been known for several years that ...