We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determining whether a given subset X generates an algebra A is P-complete, while determining the size of the smallest generating set is NP-complete. We also consider several questions related to the Frattini subuniverse, Φ(A), of an al...

We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...

For a character χ of finite group G, the co-degree is c (1)=[G:kerχ] χ(1). Let p be prime and let e positive integer. In this paper, we first show that if G p-solvable such e+1 ∤χ (1), for every irreducible then p-length not greater than e. Next, study groups satisfying condition 2 does divide co-degrees their characters.