Pages that link to "Item:Q1041802"
From MaRDI portal
The following pages link to A large lower bound on the query complexity of a simple Boolean function (Q1041802):
Displaying 4 items.
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds (Q5130847) (← links)
- Testability in group theory (Q6076186) (← links)