Pages that link to "Item:Q3792240"
From MaRDI portal
The following pages link to The Parallel Complexity of Abelian Permutation Group Problems (Q3792240):
Displaying 14 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)
- Computing in general Abelian groups is hard (Q1070820) (← links)
- On the computational complexity of the Abelian permutation group structure, membership and intersection problems (Q1106934) (← 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)
- Monte Carlo circuits for the abelian permutation group intersection problem (Q1820579) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- The parallel complexity of some constructions in combinatorial group theory (Q3976049) (← links)
- On the parallel complexity of linear groups (Q3988804) (← links)
- Testing membership: Beyond permutation groups (Q5096172) (← links)
- Abelian Logic Gates (Q5222545) (← links)
- On homomorphic encryption using abelian groups: classical security analysis (Q6611632) (← links)
