The following pages link to (Q4273608):
Displaying 50 items.
- A linear-time algorithm for the orbit problem over cyclic groups (Q303693) (← links)
- \textit{xTras}: a field-theory inspired \textit{xAct} package for Mathematica (Q339322) (← links)
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- Groups acting on tensor products. (Q392434) (← links)
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- Symmetries, local names and dynamic (de)-allocation of names (Q618165) (← links)
- On the complexity of matroid isomorphism problem (Q639843) (← links)
- Finding a cycle base of a permutation group in polynomial time (Q724293) (← links)
- SZK proofs for black-box group problems (Q929290) (← links)
- On the asymmetric complexity of the group-intersection problem (Q963437) (← links)
- Isomorphism and canonization of tournaments and hypertournaments (Q988566) (← links)
- Algorithms for matrix groups and the Tits alternative (Q1288201) (← links)
- Bases for primitive permutation groups and a conjecture of Babai (Q1378433) (← links)
- Computing transformation semigroups (Q1599539) (← links)
- Monte Carlo circuits for the abelian permutation group intersection problem (Q1820579) (← links)
- On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions (Q1979440) (← links)
- Primitive normalisers in quasipolynomial time (Q2071768) (← links)
- Computing normalisers of intransitive groups (Q2142483) (← links)
- Space efficient representations of finite groups (Q2194866) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Finding fixed point free elements and small bases in permutation groups (Q2357380) (← links)
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (Q2419587) (← links)
- Algorithms for permutability in finite groups. (Q2440508) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- Computing the soluble radical of a permutation group. (Q2496868) (← links)
- Public-key cryptography and invariant theory (Q2577586) (← links)
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) (Q2693019) (← links)
- Coset closure of a circulant S-ring and schurity problem (Q2797023) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- A name abstraction functor for named sets (Q2873662) (← links)
- Families of symmetries as efficient models of resource binding (Q2919450) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$ (Q3007628) (← links)
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- Expanding Generating Sets for Solvable Permutation Groups (Q3176493) (← links)
- A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
- The Parallel Complexity of Abelian Permutation Group Problems (Q3792240) (← links)
- (Q3792861) (← links)
- (Q4020769) (← links)
- (Q4025134) (← links)
- (Q4234185) (← links)
- (Q4335298) (← links)
- (Q4660701) (← links)
- Circulant graphs: recognizing and isomorphism testing in polynomial time (Q4675535) (← links)
- (Q4787523) (← links)
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- Algorithmic Problems for Metrics on Permutation Groups (Q5448642) (← links)
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice (Q5874494) (← links)
