The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell in (Inf. Comput. 178 (1), 253-262, 10 ) where they showed that this problem is in P for nilpotent groups while it is NP -complete for non-solvable groups. Since then, several results have appeared showing that the problem can be solved in polynomial time in certain solvable groups G having a nilpotent normal subgroup H with nilpotent factor G / H . This paper shows that such a normal subgroup must exist in each finite group with equation satisfiability solvable in polynomial time, unless the Exponential Time Hypothesis fails.
This paper is concerned with the generalization of the finite element method via the use of non-polynomial enrichment functions. Several methods employ this general approach, e.g. the extended finite element method and the generalized finite element method. We review these approaches and interpret them in the more general framework of the partition of unity method. Here we focus on fundamental construction principles, approximation properties and stability of the respective numerical method. To this end, we consider meshbased and meshfree generalizations of the finite element method and the use of smooth, discontinuous, singular and numerical enrichment functions.
