106 search results - page 8 / 22 » Probabilistically Checkable Arguments |
ECCC
2010
13 years 8 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
The Noisy-OR function is extensively used in probabilistic reasoning, and usually justified with heuristic arguments. This paper investigates sets of conditions that imply the No...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
DSN
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper reports work to support dependability arguments about the future reliability of a product before there is direct empirical evidence. We develop a method for estimating ...
CSFW
2007
IEEE
14 years 2 months ago
2007
IEEE
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...