On the parity complexity measures of Boolean functions
type: Item
instance of: scholarly article
title: On the parity complexity measures of Boolean functions
zbMATH Open document ID: 1207.68170
author: Yaoyun Shi
author: Zhi-Qiang Zhang
published in: Theoretical Computer Science
publication date: 2010-06-07T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5717743
zbMATH Keywords: computational complexity
zbMATH Keywords: communication complexity
zbMATH Keywords: parity decision tree
zbMATH Keywords: log-rank conjecture
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.03.027
OpenAlex ID: W1609754208
cites work: Quantum lower bounds by polynomials
cites work: Complexity measures and decision tree complexity: a survey.
cites work: Communication Complexity
cites work: CREW PRAM<scp>s</scp> and Decision Trees
cites work: Q3396635
cites work: Q3636247
DOI: 10.1016/J.TCS.2010.03.027
Recommended article: Complexity and structure of circuits for parity functions
Recommended article: On the Multiplicative Complexity of Boolean Functions
Recommended article: On complexity of a particular Boolean functions class
Recommended article: Q3063985
Recommended article: On the complexity of restrictions of Boolean functions
Recommended article: On the multiplicative complexity of some Boolean functions
Recommended article: Q4036699
Recommended article: Complexity of implementation of parity functions in the ``implication-negation'' basis
Recommended article: On the complexity of balanced Boolean functions
Recommended article: On the modulo degree complexity of Boolean functions
description: scientific article; zbMATH DE number 5717743