1401 search results - page 30 / 281 » Randomness in Interactive Proofs |
CSFW
2010
IEEE
15 years 1 months ago
2010
IEEE
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
114
click to vote
ICLP
2010
Springer
14 years 8 months ago
2010
Springer
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, t...
JCAM
2010
14 years 4 months ago
2010
We consider the random walk on Z+ = {0, 1, ...} , with up and down transition probabilities given the chain is in state x {1, 2, ...}: (1) px = 1 2 ,, 1 2x +