Pages that link to "Item:Q4374809"

The following pages link to The computational complexity of torsion-freeness of finitely presented groups (Q4374809):

Displaying 10 items.

• The isomorphism problem for torsion-free abelian groups is analytic complete (Q952542) (← links)
• The computational complexity of module socles (Q2120972) (← links)
• Erratum to: ``Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption'' (Q2178754) (← links)
• Detecting properties from descriptions of groups (Q2309493) (← links)
• Computable abelian groups (Q2795203) (← links)
• ENDOMORPHISMS OF RELATIVELY HYPERBOLIC GROUPS (Q3502749) (← links)
• Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories (Q4457733) (← links)
• The uniform Martin’s conjecture for many-one degrees (Q4691101) (← links)
• The complexity of decomposability of computable rings (Q6100980) (← links)
• An arithmetic analysis of closed surfaces (Q6567114) (← links)