Pages that link to "Item:Q2986892"
From MaRDI portal
The following pages link to Properties and applications of boolean function composition (Q2986892):
Displaying 22 items.
- Composition limits and separating examples for some Boolean function complexity measures (Q1701350) (← links)
- On block sensitivity and fractional block sensitivity (Q1992105) (← links)
- An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function (Q2003766) (← links)
- On separation between the degree of a Boolean function and the block sensitivity (Q2117108) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Composition of Boolean functions: an application to the secondary constructions of bent functions (Q2286578) (← links)
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture (Q2334869) (← links)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- On fractional block sensitivity (Q3187177) (← links)
- All Classical Adversary Methods are Equivalent for Total Functions (Q3304102) (← links)
- (Q4205391) (← links)
- (Q4577913) (← links)
- LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY (Q4635501) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- (Q5089234) (← links)
- New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity (Q5090948) (← links)
- (Q5091221) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- A Composition Theorem for Randomized Query Complexity (Q5136299) (← links)
- Quadratically tight relations for randomized query complexity (Q5915578) (← links)
- (Q6138069) (← links)
- On query complexity measures and their relations for symmetric functions (Q6547823) (← links)
