Pages that link to "Item:Q5466532"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466532):
Displaying 12 items.
- On separation between the degree of a Boolean function and the block sensitivity (Q2117108) (← links)
- An exact quantum algorithm for a restricted subtraction game (Q2190513) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- Unifying presampling via concentration bounds (Q2695631) (← links)
- Superlinear advantage for exact quantum algorithms (Q2805516) (← links)
- (Q3002756) (← links)
- Quantum adversary lower bound for element distinctness with small range (Q3191147) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- Boolean functions on $S_n$ which are nearly linear (Q5028493) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- On the modulo degree complexity of Boolean functions (Q5918108) (← links)