Real world processes with an “intensity” and “direction” component can be made complex by convenience of representation (vector fields, radar, sonar), and their processin...
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
Abstract— In this paper, we propose a non-commutative keyexchange scheme which generalizes the classical ElGamal Cipher to polycyclic groups. We will explore other classes of gro...
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
We study complexity of methods using rigid variables, like the method of matings or the tableau method, on a decidable class of predicate calculus with equality. We show some intr...