On the parity complexity measures of Boolean functions (Q974756): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.027 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1609754208 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quantum lower bounds by polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity measures and decision tree complexity: a survey. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Communication Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3396635 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3636247 / rank | |||
Normal rank | |||
Latest revision as of 22:07, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parity complexity measures of Boolean functions |
scientific article |
Statements
On the parity complexity measures of Boolean functions (English)
0 references
7 June 2010
0 references
computational complexity
0 references
communication complexity
0 references
parity decision tree
0 references
log-rank conjecture
0 references
