A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism

Petr Savický,Detlef Sieling

doi:10.1007/3-540-44612-5_60

A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism

Petr Savický, Detlef Sieling

https://doi.org/10.1007/3-540-44612-5_60

Copy DOI

Publication Date: Jan 1, 2000

Citations: 28

Affiliation: Czech Academy of Sciences, Czech Academy of Sciences, Institute of Computer Science, TU Dortmund University

#Branching Programs #Read-Once Branching Programs + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

Restricted branching programs are considered in complexity theory in order to study the space complexity of sequential computations and in applications as a data structure for Boolean functions. In this paper (⊕, k)-branching programs and (∨, k)-branching programs are considered, i.e., branching programs starting with a ⊕- (or ∨-)node with a fan-out of k whose successors are k read-once branching programs. This model is motivated by the investigation of the power of nondeterminism in branching programs and of similar variants that have been considered as a data structure. Lower bound methods for these variants of branching programs are presented, which allow to prove even hierarchy results for polynomial size (⊕; k)- and (∨, k)-branching programs with respect to k.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.