347 search results - page 6 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
ENTCS
2007
14 years 9 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
FOCI
2007
IEEE
15 years 3 months ago
2007
IEEE
— We evaluate the average waiting time between observing the price of financial markets and the next price change, especially in an on-line foreign exchange trading service for ...
BMCBI
2007
14 years 9 months ago
2007
Background: By virtue of their shared ancestry, homologous sequences are similar in their structure and function. Consequently, multiple sequence alignments are routinely used to ...
SIAMCOMP
2010
14 years 8 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...