1302 search results - page 20 / 261 » Fair Equivalence Relations |
JUCS
2006
13 years 7 months ago
2006
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
PKC
1999
Springer
13 years 12 months ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
TACS
2001
Springer
14 years 3 days ago
2001
Springer
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...
JAT
2006
13 years 7 months ago
2006
We construct a measure such that if {pn(z)} is the sequence of orthogonal polynomials relative to that measure, then the Riemann Hypothesis with simple zeros is true if and only if...
CAI
2005
Springer
13 years 7 months ago
2005
Springer
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e.,...