Composition limits and separating examples for some Boolean function complexity measures (Q1701350): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Quantum certificate complexity / 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: Properties of complexity measures for PRAMs and WRAMs / 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: Properties and applications of boolean function composition / rank | |||
Normal rank |
Latest revision as of 05:52, 15 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Composition limits and separating examples for some Boolean function complexity measures |
scientific article |
Statements
Composition limits and separating examples for some Boolean function complexity measures (English)
0 references
22 February 2018
0 references
block sensitivity
0 references
certificate complexity
0 references
fractional certificate complexity
0 references