The following pages link to Carstent Lund (Q2453542):
Displaying 6 items.
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- Proof verification and the hardness of approximation problems (Q3158513) (← links)
- On the hardness of approximating minimization problems (Q4323730) (← links)
- Random Debaters and the Hardness of Approximating Stochastic Functions (Q4337648) (← links)
- (Q6480590) (redirect page) (← links)
- Complexity results for POMSET languages (Q6493553) (← links)
