The notion of e cient proof-checking has always been central to complexity theory, and it gave rise to the deΓΏnition of the class NP. In the last 15 years there has been a number of exciting, unexpected and deep developments in complexity theory that exploited the notion of randomized and interactiv
β¦ LIBER β¦
Interactive and Probabilistic Proof of Mobile Code Safety
β Scribed by Yasuyuki Tsukada
- Book ID
- 106356224
- Publisher
- Springer US
- Year
- 2005
- Tongue
- English
- Weight
- 958 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0928-8910
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Interactive and probabilistic proof-chec
β
Luca Trevisan
π
Article
π
2000
π
Elsevier Science
π
English
β 112 KB
Enforcing Security and Safety with Proof
β
George C. Necula
π
Article
π
1999
π
Elsevier Science
π
English
β 608 KB
Analysis of Uncertainties in Interactive
β
Henrique M. Paula; David J. Campbell; Vernon H. Guthrie
π
Article
π
1993
π
Springer
π
English
β 799 KB
A probabilistic logic for the developmen
β
C.W. Johnson
π
Article
π
1993
π
Elsevier Science
β 704 KB
This paper starts from the premise that the human contribution to risk must be assessed during the development of safety-critical systems. In contrast to previous approaches, discrete numerical values are rejected as means of quantifying the probability of operator "error" for many different users o
Proof of efficacy and safety
β
William E. Jones
π
Article
π
2001
π
Elsevier Science
π
English
β 90 KB
Generalization and Probabilistic Proof o
β
Guisong Chang and Chen Xu
π
Article
π
2011
π
Mathematical Association of America
π
English
β 151 KB