The following pages link to (Q4133135):
Displaying 12 items.
- On using probabilistic Turing machines to model participants in cryptographic protocols (Q391316) (← links)
- A natural encoding scheme proved probabilistic polynomial complete (Q593778) (← links)
- The complexity of computing the permanent (Q600247) (← links)
- Uniform complexity and digital signatures (Q1154262) (← links)
- Semantics of probabilistic programs (Q1159979) (← links)
- Universal classes of hash functions (Q1259907) (← links)
- Randomised algorithms (Q1836980) (← links)
- On measure quantifiers in first-order arithmetic (Q2117748) (← links)
- Complexity of probabilistic versus deterministic automata (Q4560366) (← links)
- (Q5028447) (← links)
- Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)
