1401 search results - page 78 / 281 » Randomness in Interactive Proofs |
111
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
165
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Consider the minimum mean-square error (MMSE) of estimating an arbitrary random variable from its observation contaminated by Gaussian noise. The MMSE can be regarded as a function...
141
Voted
TARK
2009
Springer
15 years 10 months ago
2009
Springer
Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they called practical knowledge, but left open the question of finding an epistemic formula...
123
click to vote
APLAS
2009
ACM
15 years 10 months ago
2009
ACM
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...
137
Voted
APSEC
2005
IEEE
15 years 9 months ago
2005
IEEE
— Invariant based programming is an approach to program construction where we provide the program pre- and postconditions as well as loop invariants before we construct the code ...