The following pages link to Xi Chen (Q458452):
Displaying 22 items.
- (Q5302072) (← links)
- Near-optimal small-depth lower bounds for small distance connectivity (Q5361865) (← links)
- The Complexity of Optimal Multidimensional Pricing (Q5384059) (← links)
- Complexity of counting CSP with complex weights (Q5415524) (← links)
- Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set (Q5434382) (← links)
- The complexity of non-monotone markets (Q5495788) (← links)
- Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems (Q5495797) (← links)
- (Q5875500) (← links)
- Graph homomorphisms with complex values: a dichotomy theorem (Q5891164) (← links)
- Algorithms and Computation (Q5897870) (← links)
- Graph Homomorphisms with Complex Values: A Dichotomy Theorem (Q5901171) (← links)
- A Lower Bound on Cycle-Finding in Sparse Digraphs (Q6058259) (← links)
- Efficient average-case population recovery in the presence of insertions and deletions (Q6322026) (← links)
- Testing Sumsets is Hard (Q6517313) (← links)
- Approximate trace reconstruction from a single trace (Q6538554) (← links)
- Average-case subset balancing problems (Q6575105) (← links)
- Near-optimal average-case approximate trace reconstruction from few traces (Q6575106) (← links)
- Computational hardness of the Hylland-Zeckhauser scheme (Q6575164) (← links)
- Reducing Tarski to unique Tarski (In the Black-Box model) (Q6640358) (← links)
- Mildly exponential lower bounds on tolerant testers for monotonicity, unateness, and juntas (Q6645520) (← links)
- Smoothed complexity of SWAP in local graph partitioning (Q6645554) (← links)
- Subset sum in time \(2^{n/2}/\text{poly}(n)\) (Q6663054) (← links)
