Generalized Problem of Sratlikeness for Products of P-Valent Starlike Functions

∗ Partially supported by grant No. 433/94 NSF of the Ministry of Education and Science of the Republic of Bulgaria 1991 Mathematics Subject Classification:30C45

Examples Illustrating some Aspects of the Weak Deligne-Simpson Problem

Research partially supported by INTAS grant 97-1644

Decision Trees for Applicability of Evolution Rules in Transition P Systems

Transition P Systems are a parallel and distributed computational model based on the notion of the cellular membrane structure. Each membrane determines a region that encloses a multiset of objects and evolution rules. Transition P Systems evolve through transitions between two consecutive configurations that are determined by the membrane structure and multisets present inside membranes. Moreover, transitions between two consecutive configurations are provided by an exhaustive non-deterministic and parallel application of active evolution rules subset inside each membrane of the P system. But, to establish the active evolution rules subset, it is required the previous calculation of useful and applicable rules. Hence, computation of applicable evolution rules subset is critical for the whole evolution process efficiency, because it is performed in parallel inside each membrane in every evolution step. The work presented here shows advantages of incorporating decision trees in the evolution rules applicability algorithm. In order to it, necessary formalizations will be presented to consider this as a classification problem, the method to obtain the necessary decision tree automatically generated and the new algorithm for applicability based on it.

Pseudo-Differential Operators in a Wave Diffraction Problem with Impedance Conditions

Mathematics Subject Classification: 35J05, 35J25, 35C15, 47H50, 47G30

Anti-Periodic Boundary Value Problem for Impulsive Fractional Integro Differential Equations

MSC 2010: 34A37, 34B15, 26A33, 34C25, 34K37

Linearly Normal Curves in P^n

2000 Mathematics Subject Classification: 14H45, 14H50, 14J26.

A Fast Algorithm for Weber Problem on a Grid

AMS subject classification: 90B80.

Problems for P-Monge-Ampere Equations

2010 Mathematics Subject Classification: 35A23, 35B51, 35J96, 35P30, 47J20, 52A40.

On the Time Complexity of the Problem Related to Reducts of Consistent Decision Tables

In recent years, rough set approach computing issues concerning reducts of decision tables have attracted the attention of many researchers. In this paper, we present the time complexity of an algorithm computing reducts of decision tables by relational database approach. Let DS = (U, C ∪ {d}) be a consistent decision table, we say that A ⊆ C is a relative reduct of DS if A contains a reduct of DS. Let s = be a relation schema on the attribute set C ∪ {d}, we say that A ⊆ C is a relative minimal set of the attribute d if A contains a minimal set of d. Let Qd be the family of all relative reducts of DS, and Pd be the family of all relative minimal sets of the attribute d on s. We prove that the problem whether Qd ⊆ Pd is co-NP-complete. However, the problem whether Pd ⊆ Qd is in P .

On realizability of p-groups as Galois groups

2000 Mathematics Subject Classification: 12F12, 15A66.