3228 search results - page 206 / 646 » Computationally Sound Proofs |
172
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
160
click to vote
DEXAW
2004
IEEE
15 years 10 months ago
2004
IEEE
The overall goal of this research is to improve the `environment awareness' aspect of personal autonomic computing. Personal Computing offers unique challenges for self-manag...
146
click to vote
MFCS
1989
Springer
15 years 10 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
177
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent u...
153
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...