The average sensitivity of bounded-depth formulas (Q1653335): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1508.07677 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Quantum Query Complexity of Read-Many Formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The average sensitivity of bounded-depth circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of the realization of a linear function in the class of \(\Pi\)-circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formulas vs. circuits for small distance connectivity / rank | |||
Normal rank |
Latest revision as of 06:49, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The average sensitivity of bounded-depth formulas |
scientific article |
Statements
The average sensitivity of bounded-depth formulas (English)
0 references
3 August 2018
0 references
lower bounds
0 references
parity
0 references
\(\mathrm{AC}^{0}\)
0 references