( en | de | ru )

 

Disambiguation of "Goldberg, Leslie Ann"

Author of the publication

copydeleteadd this publication to your clipboard
The Relative Complexity of Approximate Counting Problems

, , , and . Algorithmica, 38 (3): 471--500 (March 2004)

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.

Leslie Melters

Leslie Schlüter

Leslie Knolle

Leslie Tramontini

Leslie Heckmann

 

Other publications of authors with the same name

Log-supermodular functions, functional clones and counting CSPs., , , and . STACS, volume 14 of LIPIcs, page 302-313. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Functional Clones and Expressibility of Partition Functions., , , , and . CoRR, (2016)Approximately Counting H-Colourings is #BIS # BIS -Hard., , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 529-541. Springer, (2015)Inapproximability of the Tutte polynomial., and . STOC, page 459-468. ACM, (2007)Adaptive Drift Analysis., and . PPSN (1), volume 6238 of Lecture Notes in Computer Science, page 32-41. Springer, (2010)Drift Analysis with Tail Bounds., and . PPSN (1), volume 6238 of Lecture Notes in Computer Science, page 174-183. Springer, (2010)Routing in Optical networks: The problem of contention.. Interconnection Networks and Mapping and Scheduling Parallel Computations, volume 21 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 173-180. DIMACS/AMS, (1994)Random Walks on Small World Networks., , , , and . CoRR, (2017)The complexity of approximately counting in 2-spin systems on $k$-uniform bounded-degree hypergraphs., and . CoRR, (2015)Inapproximability of the independent set polynomial in the complex plane., , , and . CoRR, (2017)