PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Gasarch, William"

Author of the publication

copydeleteadd this publication to your clipboard
Open Problems Column.

. SIGACT News, 49 (4): 28 (2018)

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.

No persons found for author name Gasarch, William
add a person with the name Gasarch, William
 

Other publications of authors with the same name

Review of Factor Man by Matt Ginsberg.. SIGACT News, 50 (4): 7-8 (2019)Open Problems Column.. SIGACT News, 50 (4): 26-30 (2019)Distinct volume subsets via indiscernibles., and . Arch. Math. Log., 58 (3-4): 469-483 (2019)A Muffin-Theorem Generator., , , , , , , , and . FUN, volume 100 of LIPIcs, page 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)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)