the allocation of human resources to project activities in order to schedule them is one of the closest states to the actual conditions of scheduling problems. but regarding the fact that this problem belongs to the class of np-hard problems; so far the exact methods have only been able to solve the small size problems. in this study, the renewable resources are humans in a way that every staff...

We give lower bounds on the complexity of word problem for a large class non-solvable infinite groups that we call strongly efficiently groups. This includes free groups, Grigorchuk’s group, and Thompson’s prove these have an NC 1 -hard some them (including group groups) compressed (which is equivalent to circuit evaluation problem) PSPACE-complete.

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8,44,3...