Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...
This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions, and describes the properties of the duality principle on th...