Login / Signup

The Round Complexity of Two-Party Random Selection.

Saurabh SanghviSalil P. Vadhan
Published in: SIAM J. Comput. (2008)
Keyphrases
  • random selection
  • randomly selected
  • active learning
  • computational complexity
  • test set
  • decision problems
  • space complexity
  • computational cost
  • np complete
  • benchmark datasets