Pages that link to "Item:Q3792240"
From MaRDI portal
The following pages link to The Parallel Complexity of Abelian Permutation Group Problems (Q3792240):
Displayed 8 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- Membership testing in commutative transformation semigroups (Q1108790) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- An \(NC^ 2\) algorithm for testing similarity of matrices (Q1116651) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- On the parallel complexity of linear groups (Q3988804) (← links)
- Testing membership: Beyond permutation groups (Q5096172) (← links)