The following pages link to Jin-Yi Cai (Q269464):
Displaying 50 items.
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- Erratum to: ``Signature theory in holographic algorithms'' (Q289936) (← links)
- A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes (Q294649) (← links)
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
- The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← links)
- A computational proof of complexity of some restricted counting problems (Q534558) (← links)
- Holographic algorithms: from art to science (Q619900) (← links)
- Quadratic lower bound for permanent vs. determinant in any characteristic (Q623498) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- Signature theory in holographic algorithms (Q652529) (← links)
- Honeynet games: A game theoretic approach to defending network monitors (Q652631) (← links)
- Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
- (Q809597) (redirect page) (← links)
- A note on enumerative counting (Q809598) (← links)
- A note on quadratic residuosity and UP (Q834917) (← links)
- On the theory of matchgate computations (Q841626) (← links)
- On blockwise symmetric signatures for matchgates (Q846363) (← links)
- \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
- (Q917288) (redirect page) (← links)
- Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
- Basis collapse in holographic algorithms (Q937202) (← links)
- A novel information transmission problem and its optimal solution (Q963637) (← links)
- On symmetric signatures in holographic algorithms (Q968267) (← links)
- Holographic algorithms: the power of dimensionality resolved (Q1014633) (← links)
- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy (Q1118405) (← links)
- Robust reductions (Q1125798) (← links)
- On games of incomplete information (Q1199525) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- A note on the determinant and permanent problem (Q1263283) (← links)
- On a scheduling problem of time deteriorating jobs (Q1271170) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- PSPACE is provable by two provers in one round (Q1318475) (← links)
- On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line (Q1342862) (← links)
- Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns (Q1383799) (← links)
- Frobenius's degree formula and Toda's polynomials (Q1384709) (← links)
- On testing for zero polynomials by a set of points with bounded precision. (Q1401255) (← links)
- Essentially every unimodular matrix defines an expander (Q1405803) (← links)
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Complexity classification of the six-vertex model (Q1706146) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- Clifford gates in the Holant framework (Q1786604) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- A lattice-based public-key cryptosystem (Q1854277) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
