We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment-matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as Markov cubature rules. The polynomial property allows us to study the existence of such rules using algebraic techniques. These rules aim to improve the tractab...

We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a perfect matching or not and (2) a unique perfect matching or not, are in the logspace complexity class SPL. Since SPL is contained in the logspace counting classe...

In this paper we consider the problem of secure pattern matching that allows singlecharacter wildcards and substring matching in the malicious (stand-alone) setting. Our protocol, called 5PM, is executed between two parties: Server, holding a text of length n, and Client, holding a pattern of length m to be matched against the text, where our notion of matching is more general and includes non-...

Given a universe U := U1]· · ·]Ur, and a r-uniform family F ⊆ U1×· · ·×Ur, the r-dimensional matching problem asks if F admits a collection of k mutually disjoint sets. The special case when r = 3 is the classic 3D-Matching problem. Recently, several improvements have been suggested for these (and closely related) problems in the setting of randomized parameterized algorithms. Also, many approa...

In this paper we consider the problem of secure pattern matching that allows singlecharacter wildcards and substring matching in the malicious (stand-alone) setting. Our protocol, called 5PM, is executed between two parties: Server, holding a text of length n, and Client, holding a pattern of length m to be matched against the text, where our notion of matching is more general and includes non-...

the principal aim of this paper is to serve the numerical solution of an integral-algebraic equation (iae) by using the bernoulli polynomials and the residual correction method. after implementation of our scheme, the main problem would be transformed into a system of algebraic equations such that its solutions are the unknown bernoulli coefficients. thismethod gives an analytic solution when t...

the concept of algebraic hyperstructures introduced by marty as a generalization of ordinary algebraic structures. in an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. the concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyper rings and a generalizat...

The paper is devoted to concern a relationship between rough set theory and universal algebra. Notions of lower and upper rough approximations on an algebraic structure induced by an ideal are introduced and some of their properties are studied. Also, notions of rough subalgebras and rough ideals with respect to an ideal of an algebraic structure, which is an extended notion of subalgebras and ...