The following pages link to (Q3096563):
Displaying 8 items.
- Probably bounded suboptimal heuristic search (Q2321255) (← links)
- A coding theoretic study of MLL proof nets (Q2888855) (← links)
- Efficient Probabilistically Checkable Debates (Q3088122) (← links)
- (Q4527017) (← links)
- (Q4823138) (← links)
- Probabilistic relational verification for cryptographic implementations (Q5408416) (← links)
- On the concrete efficiency of probabilistically-checkable proofs (Q5495829) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)