Complexity of computing normal subgroup

From: Pinaki Mitra (u725372314_at_spawnkill.ip-mobilphone.net)
Date: 12/31/03 

Date: Wed, 31 Dec 2003 08:49:22 GMT

What is the computational complexity of
the testing of existence of a normal subgroup
of a group besides the trivial one containing
the identity element. Is it polynomial or
NP-complete ?

--- Pinaki Mitra
  

-- 
Sent by  pinaki_m  from hotmail subpart from com
This is a spam protected message. Please answer with reference header.
Posted via http://www.usenet-replayer.com

Relevant Pages

  • Re: Complexity of computing normal subgroup
    ... >> the testing of existence of a normal subgroup ... If the input is via a finite presentation, ...
    (comp.theory)
  • Re: Complexity of computing normal subgroup
    ... > the testing of existence of a normal subgroup ...
    (comp.theory)
  • Re: randomness
    ... Existence of a multiplicative identity ... Existence of additive inverses ... For every a belonging to F, there exists an element ?a in F, such that a + ... is an abelian group with identity element 0: ...
    (sci.math)
  • Re: Mapping Reals to Natural numbers.
    ... Nothing in that paragraph is true. ... When ever we claim the existence of an irrational number n, we simultaneously suggest that we have compared that number to set for which the identity element is known. ... suggesting that I compared sqrtto a set? ...
    (sci.math)
  • quotients of quotient groups
    ... If N is a normal subgroup of G, ... the quotient /f ... since K is the identity element of G/K? ...
    (sci.math)