Pages that link to "Item:Q1332666"
From MaRDI portal
The following pages link to Function-algebraic characterizations of log and polylog parallel time (Q1332666):
Displaying 7 items.
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- A characterization of alternating log time by ramified recurrence (Q1978645) (← links)
- A Characterization of NC k by First Order Functional Programs (Q3502640) (← links)
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time (Q4673356) (← links)
- (Q5089032) (← links)
