BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Shuai Shao (University of Wisconsin-Madison) DTSTART:20201111T180000Z DTEND:20201111T190000Z DTSTAMP:20260423T021010Z UID:TCSPlus/17 DESCRIPTION:Title: A Dichotomy for Real Boolean Holant Problems\nby Shuai Shao (Universi ty of Wisconsin-Madison) as part of TCS+\n\n\nAbstract\nAbstract: In this talk\, we present a complexity dichotomy for Holant problems on the boolea n domain with arbitrary sets of real-valued constraint functions. These co nstraint functions need not be symmetric nor do we assume any auxiliary fu nctions as in previous results. It is proved that for every set F of real- valued constraint functions\, Holant(F) is either P-time computable or #P- hard. The classification has an explicit criterion. This is a culmination of much research on a decade-long classification program for Holant proble ms\, and it uses previous results and techniques from many researchers. H owever\, as it turned out\, the journey to the present theorem has been ar duous. Some particularly intriguing concrete functions f6\, f8 and their a ssociated families with extraordinary closure properties related to Bell s tates in quantum information theory play an important role in this proof. \n\nBased on joint work with Jin-Yi Cai.\n LOCATION:https://researchseminars.org/talk/TCSPlus/17/ END:VEVENT END:VCALENDAR