ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Hierarchies of circuit classes that are closed under complement

Vinay, V (1996) Hierarchies of circuit classes that are closed under complement. In: 11th Annual IEEE Conference on Computational Complexity, MAY 24-27, 1996, PHILADELPHIA.

[img] PDF
Hierarchies_of_Circuit.pdf - Published Version
Restricted to Registered users only

Download (876Kb) | Request a copy
Official URL: http://ieeexplore.ieee.org/search/srchabstract.jsp...

Abstract

We examine three hierarchies of circuit classes and show they are closed under complementation. (1) The class of languages recognized by a family of polynomial size skew circuits with width O(w), are closed under complement. (2) The class of languages recognized by family of polynomial size circuits with width O(w) and polynomial tree-size, are closed under complement. (3) The class of languages recognized by a family of polynomial size, O(log(n)) depth, bounded AND fan-in with OR fan-in f (f⩾log(n)) circuits are closed under complement. These improve upon the results of (i) Immerman (1988) and Szelepcsenyi (1988), who show that 𝒩L𝒪𝒢 is closed under complementation, and (ii) Borodin et al. (1989), who show that L𝒪𝒢𝒞ℱL is closed under complement

Item Type: Conference Paper
Additional Information: Copyright 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material foradvertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 28 Apr 2011 09:46
Last Modified: 28 Apr 2011 09:46
URI: http://eprints.iisc.ernet.in/id/eprint/37282

Actions (login required)

View Item View Item