Variants of Kannan's Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively presentable classes of languages that use advice string...
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...
In a text categorization task, classification on some hierarchy of classes shows better results than the case without the hierarchy. In current environments where large amount of ...
We observe that the W∗ -hierarchy, a variant (introduced by Downey, Fellows, and Taylor [8]) of the better known W-hierarchy, coincides with the W-hierarchy, though not level wi...