Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
In the previous years some authors have been elaborating on the measurementtheoretic foundations of fuzzy set theory. A well-known problem in this approach is the difficult applic...