- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**We prove a complexity classification theorem that classifies all counting constraint satisfaction problems (#CSP) over Boolean variables into exactly three classes: (1) Polynomial-time solvable; (2)… Expand

Holographic algorithms with matchgates are a novel approach to design polynomial time computation. They use Kasteleyn's algorithm for perfect matchings, and more importantly a holographic reduction.… Expand

The efficiency of energy piles depends on their dimensions and the heat and moisture transfer characteristics of soils and pile materials. Conductive heat transfer in soil deposits is based on the… Expand

An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized under a suitable basis transformation (SRP). For holographic algorithms with… Expand

IEEE 56th Annual Symposium on Foundations of…

We prove a complexity dichotomy for complex-weighted Holant problems with an arbitrary set of symmetric constraint functions on Boolean variables. In the study of counting complexity, such as #CSP,… Expand

Abstract We prove a complexity dichotomy theorem for the six-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in… Expand

Medical science monitor : international medical…

Background This study aimed to compare the surgical outcomes between open pedicle screw fixation (OPSF) and percutaneous pedicle screw fixation (PPSF) for the treatment of thoracolumbar fractures,… Expand

We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial… Expand

Unique prime factorization of integers is taught in every high school. We define and explore a notion of unique prime factorization for constraint functions, and use this as a new tool to prove a… Expand

We prove a complexity classification theorem that divides the six-vertex model on graphs into exactly three types. For every setting of the parameters of the model, the computation of the partition… Expand