The following pages link to (Q3912839):
Displaying 26 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)
- On the complexity of deduction modulo leaf permutative equations (Q556681) (← links)
- Computing the composition factors of a permutation group in polynomial time (Q581532) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744) (← links)
- The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
- Efficient representation of perm groups (Q1180408) (← links)
- Polynomial time recognition and testing of isomorphism of cyclic tournaments (Q1190955) (← links)
- Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments (Q1201912) (← links)
- Graph isomorphism is low for PP (Q1210331) (← links)
- Algorithms for matrix groups and the Tits alternative (Q1288201) (← links)
- Monte Carlo circuits for the abelian permutation group intersection problem (Q1820579) (← links)
- Subcomplete generalizations of graph isomorphism (Q1838044) (← links)
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (Q1902472) (← links)
- A time-based solution for the graph isomorphism problem (Q2192286) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Completely Reachable Automata (Q2829965) (← links)
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- Representing Groups on Graphs (Q3182934) (← links)
- (Q5089162) (← links)
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (Q5111861) (← links)
- The subpower membership problem for semigroups (Q5298321) (← links)
