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...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Zhang, Zhiqiang, Shi, Yaoyun
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 03.04.2010
Predmet:	Boolean algebra Boolean functions Complexity Decision trees Parity
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!