A Holant Dichotomy: Is the FKT Algorithm Universal?

12 May 2015 Cai Jin-Yi Fu Zhiguo Guo Heng Williams Tyson

We prove a complexity dichotomy for complex-weighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables. This dichotomy is specifically to answer the question: Is the FKT algorithm under a holographic transformation a \emph{universal} strategy to obtain polynomial-time algorithms for problems over planar graphs that are intractable in general?.. (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY
  • DATA STRUCTURES AND ALGORITHMS