Pages that link to "Item:Q580980"
From MaRDI portal
The following pages link to Properties of complexity measures for PRAMs and WRAMs (Q580980):
Displaying 7 items.
- The complexity of symmetric functions in bounded-depth circuits (Q1107989) (← links)
- Parallel information-based complexity (Q1186504) (← links)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Composition limits and separating examples for some Boolean function complexity measures (Q1701350) (← links)
- The nonapproximability of OBDD minimization (Q1854498) (← links)
- Quantum certificate complexity (Q2475404) (← links)