( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Testing that distributions are close.

, , , , и . FOCS, стр. 259-269. IEEE Computer Society, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Lance Jenott

Georg Lancelle

Lance Good

Lance Gardner

Lance Ashdown

 

Другие публикации лиц с тем же именем

Multi-outcome and Multidimensional Market Scoring Rules, и . CoRR, (2012)Bounding Rationality by Discounting Time, и . CoRR, (2009)The Complexity of Perfect Zero-Knowledge (Extended Abstract). STOC, стр. 204-209. ACM, (1987)Testing Closeness of Discrete Distributions., , , , и . J. ACM, 60 (1): 4:1-4:25 (2013)Diagonalization.. Current Trends in Theoretical Computer Science, World Scientific, (2001)Resource-Bounded Instance Complexity (Extended Abstract)., и . STACS, том 900 из Lecture Notes in Computer Science, стр. 597-608. Springer, (1995)Using Depth to Capture Average-Case Complexity., , и . FCT, том 2751 из Lecture Notes in Computer Science, стр. 303-310. Springer, (2003)Prediction and Dimension., и . COLT, том 2375 из Lecture Notes in Computer Science, стр. 380-395. Springer, (2002)Optimal Proof Systems and Sparse Sets., , , и . STACS, том 1770 из Lecture Notes in Computer Science, стр. 407-418. Springer, (2000)Measure, Category and Learning Theory., , , , , , и . ICALP, том 944 из Lecture Notes in Computer Science, стр. 558-569. Springer, (1995)