TOPICS
Search

Search Results for ""


351 - 360 of 1005 for complexity measureSearch Results
Let f be a finite real-valued function defined on an interval [a,b]. Then at every point in [a,b] except on a set of Lebesgue measure zero, either: 1. There is a finite ...
Informally, an L^2-function is a function f:X->R that is square integrable, i.e., |f|^2=int_X|f|^2dmu with respect to the measure mu, exists (and is finite), in which case ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...
There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...
A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...
An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...
A generalization of the Lebesgue integral. A measurable function f(x) is called A-integrable over the closed interval [a,b] if m{x:|f(x)|>n}=O(n^(-1)), (1) where m is the ...
A property of X is said to hold almost everywhere if the set of points in X where this property fails is contained in a set that has measure zero.
Let (X,B,mu) be a measure space and let E be a measurable set with mu(E)<infty. Let {f_n} be a sequence of measurable functions on E such that each f_n is finite almost ...
Euler integration was defined by Schanuel and subsequently explored by Rota, Chen, and Klain. The Euler integral of a function f:R->R (assumed to be piecewise-constant with ...
1 ... 33|34|35|36|37|38|39 ... 101 Previous Next

...