Author of the publication

Joint review of "Three Blogs by theorists: Computational Complexity (weblog.fortnow.com) by Lance Fortnow, Shtetl-Optimized (www.scottaaronson.com/blog/) by Scott Aaronson, In theory (in-theory.blogspot.com) by Luca Trevisan, ".

. SIGACT News, 38 (2): 23-25 (2007)

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.

 

Other publications of authors with the same name

Polynomial Terse Sets, and . Inf. Comput., 77 (1): 37-56 (April 1988)On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case., and . Ann. Pure Appl. Logic, 45 (1): 1-38 (1989)Nondeterministic Bounded Query Reducibilities., , and . Ann. Pure Appl. Logic, 41 (2): 107-118 (1989)On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case., and . Ann. Pure Appl. Logic, 45 (3): 227-246 (1989)The complexity of learning SUBSEQ(A)., , and . J. Symb. Log., 74 (3): 939-975 (2009)Frequency Computation and Bounded Queries., , and . Theor. Comput. Sci., 163 (1&2): 177-192 (1996)Learning programs with an easy to calculate set of errors., , , and . Fundam. Inform., 16 (3-4): 355-370 (1992)Learning via Queries to an Oracle., and . COLT, page 214-229. Morgan Kaufmann, (1989)Learning Via Queries With Teams and Anomilies., , , , and . COLT, page 327-337. Morgan Kaufmann, (1990)Limits on the Computational Power of Random Strings., , and . Electronic Colloquium on Computational Complexity (ECCC), (2010)