Author of the publication

Approximation and Hardness Results for Label Cut and Related Problems.

, , , and . TAMC, volume 5532 of Lecture Notes in Computer Science, page 460-469. Springer, (2009)

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

A Note on Enumarative Counting., and . Inf. Process. Lett., 38 (4): 215-219 (1991)Holographic algorithms with unsymmetric signatures., and . SODA, page 54-63. SIAM, (2008)Relativized collapsing between BPP and PH under stringent oracle access., and . Inf. Process. Lett., 90 (3): 147-154 (2004)Subquadratic Simulations of Circuits by Branching Programs, and . FOCS, page 568-573. IEEE Computer Society, (1989)Holant problems and counting CSP., , and . STOC, page 715-724. ACM, (2009)On Tractable Exponential Sums., , , and . FAW, volume 6213 of Lecture Notes in Computer Science, page 148-159. Springer, (2010)A Holant Dichotomy: Is the FKT Algorithm Universal?, , , and . FOCS, page 1259-1276. IEEE Computer Society, (2015)On the Average-Case Hardness of CVP.. FOCS, page 308-317. IEEE Computer Society, (2001)On Block-Wise Symmetric Signatures for Matchgates., and . FCT, volume 4639 of Lecture Notes in Computer Science, page 187-198. Springer, (2007)X-Diff: An Effective Change Detection Algorithm for XML Documents., , and . ICDE, page 519-530. IEEE Computer Society, (2003)