8824 search results - page 192 / 1765 » On the Complexity of Real Functions |
181
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
170
click to vote
ECSQARU
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from t...
119
click to vote
ENTCS
2008
15 years 6 months ago
2008
We de ne the e ective integrability of Fine-computable functions and e ectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theo...
126
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We provide a rule to calculate the subdifferential of the pointwise supremum of an arbitrary family of convex functions defined on a real locally convex topological vector space. ...
151
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Suppose a function of N real source variables XN 1 = (X1, X2, . . . , XN ) is desired at a destination constrained to receive a limited number of bits. If the result of evaluating...