347 search results - page 3 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
ASIAN
2007
Springer
13 years 12 months ago
2007
Springer
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...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
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...
CCA
2009
Springer
13 years 9 months ago
2009
Springer
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...
IJFCS
2008
13 years 5 months ago
2008
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...
AMC
2006
13 years 5 months ago
2006
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...