The following pages link to Mingji Xia (Q395010):
Displaying 25 items.
- The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
- A computational proof of complexity of some restricted counting problems (Q534558) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- Complexity classification of the six-vertex model (Q1706146) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
- Computing linear arithmetic representation of reachability relation of one-counter automata (Q2169112) (← links)
- Computational complexity of counting problems on 3-regular planar graphs (Q2382289) (← links)
- Rectangle transformation problem (Q2415366) (← links)
- Counting \(K_4\)-subdivisions (Q2515581) (← links)
- Computational Complexity of Holant Problems (Q3096095) (← links)
- (Q3113689) (← links)
- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems (Q3587417) (← links)
- A Computational Proof of Complexity of Some Restricted Counting Problems (Q3630198) (← links)
- (Q4608007) (← links)
- Splitting and jump inversion in the Turing degrees (Q4683147) (← links)
- (Q4910745) (← links)
- Holant problems and counting CSP (Q5172769) (← links)
- Base collapse of holographic algorithms (Q5361880) (← links)
- (Q5365150) (← links)
- Maximum Edge-Disjoint Paths Problem in Planar Graphs (Q5425468) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Dichotomy for Holant Problems with a Function on Domain Size 3 (Q5741802) (← links)
- Theory and Applications of Models of Computation (Q5898890) (← links)
