Pages that link to "Item:Q1116695"
From MaRDI portal
The following pages link to Complexity theory of parallel time and hardware (Q1116695):
Displaying 7 items.
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Cyclic Boolean circuits (Q442202) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Parallel pointer machines (Q2366720) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
