On the parity complexity measures of Boolean functions

The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non-deterministic complexity of the function or its comp...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Zhang, Zhiqiang, Shi, Yaoyun
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 03.04.2010
Subjects:	Boolean algebra Boolean functions Complexity Decision trees Parity
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!