1717 search results - page 11 / 344 » A Computable Spectral Theorem |
119
Voted
CSFW
2008
IEEE
15 years 10 months ago
2008
IEEE
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
132
Voted
CIE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
118
Voted
ENTCS
2008
15 years 3 months ago
2008
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
141
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
129
Voted
SIAMCOMP
2008
15 years 3 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...