( en | de | ru )

 

Disambiguation of "Fortnow, Lance"

Author of the publication

copydeleteadd this publication to your clipboard
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws.

, , , , and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 335-345. Springer, (2006)

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. You can also use the button next to the name to display some publications already assigned to the person.

Lance Jenott

Georg Lancelle

Lance Good

Lance Gardner

Lance Ashdown

 

Other publications of authors with the same name

Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?, , , , and . Theory Comput. Syst., 46 (1): 143-156 (2010)Resource-Bounded Instance Complexity (Extended Abstract)., and . STACS, volume 900 of Lecture Notes in Computer Science, page 597-608. Springer, (1995)Measure, Category and Learning Theory., , , , , , and . ICALP, volume 944 of Lecture Notes in Computer Science, page 558-569. Springer, (1995)Optimal Proof Systems and Sparse Sets., , , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 407-418. Springer, (2000)Prediction and Dimension., and . COLT, volume 2375 of Lecture Notes in Computer Science, page 380-395. Springer, (2002)Using Depth to Capture Average-Case Complexity., , and . FCT, volume 2751 of Lecture Notes in Computer Science, page 303-310. Springer, (2003)Diagonalization.. Current Trends in Theoretical Computer Science, World Scientific, (2001)Testing Closeness of Discrete Distributions., , , , and . J. ACM, 60 (1): 4:1-4:25 (2013)Sophistication Revisited., and . Theory Comput. Syst., 45 (1): 150-161 (2009)Interactive Proof Systems and Alternating Time-Space Complexity., and . Theor. Comput. Sci., 113 (1): 55-73 (1993)