Pages that link to "Item:Q1166603"

The following pages link to A polynomial bound for the orders of primitive solvable groups (Q1166603):

Displaying 42 items.

• The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups (Q324208) (← links)
• Normalizers of primitive permutation groups (Q520380) (← links)
• Isomorphism and canonization of tournaments and hypertournaments (Q988566) (← links)
• Sylow's theorem in polynomial time (Q1063109) (← links)
• Solvability by radicals is in polynomial time (Q1071803) (← links)
• Parallel algorithms for solvable permutation groups (Q1111023) (← links)
• A bound on the rank of primitive solvable permutation groups (Q1113279) (← links)
• Isomorphism of graphs of bounded valence can be tested in polynomial time (Q1168744) (← 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)
• \(\sqrt{2}+\sqrt{3}\): Four different views (Q1284617) (← links)
• Large orbits of supersolvable linear groups (Q1291108) (← links)
• Graph isomorphism problem and \(2\)-closed permutation groups (Q1311608) (← links)
• Asymptotic results for primitive permutation groups (Q1355504) (← links)
• Groups without faithful transitive permutation representations of small degree (Q1369259) (← links)
• Upper bounds for the number of conjugacy classes of a finite group (Q1375963) (← links)
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
• Testing isomorphism of circulant objects in polynomial time (Q2010626) (← links)
• Bounding the orders of nilpotent subgroups of solvable linear groups (Q2106259) (← links)
• The number of set-orbits of a solvable permutation group (Q2111340) (← links)
• Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
• Base sizes for primitive groups with soluble stabilisers (Q2239243) (← links)
• A survey of homogeneous structures (Q2275386) (← links)
• The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time (Q2313298) (← links)
• Finite groups with large Noether number are almost cyclic (Q2326257) (← links)
• On a conjecture of Gluck. (Q2339681) (← links)
• The size of the solvable residual in finite groups. (Q2469766) (← links)
• On the probability of generating prosoluble groups. (Q2472728) (← links)
• On the probability of generating free prosoluble groups of small rank. (Q2472729) (← links)
• Bounds on finite quasiprimitive permutation groups (Q2765556) (← links)
• Transitive projective planes and insoluble groups. (Q2790581) (← links)
• The minimal base size for a \(p\)-solvable linear group (Q2809179) (← links)
• Permutation Groups and the Graph Isomorphism Problem (Q2821703) (← links)
• Algorithms in Algebraic Number Theory (Q4005808) (← links)
• On the orders of primitive linear <i>P'</i>-groups (Q4283043) (← links)
• Circulant graphs: recognizing and isomorphism testing in polynomial time (Q4675535) (← links)
• Primitive sharp permutation groups with large solvable subgroups (Q5292696) (← links)
• Intersections of maximal subgroups in prosolvable groups (Q5384662) (← links)
• Finitely generated groups with polynomial index growth (Q5459212) (← links)
• Linear groups (Q5902851) (← links)
• Nilpotent subgroups of finite soluble groups (Q5905401) (← links)
• Finite groups, minimal bases and the intersection number (Q6165641) (← links)