The following pages link to Xi Chen (Q458452):
Displaying 50 items.
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Quadratic lower bound for permanent vs. determinant in any characteristic (Q623498) (← links)
- On incentive compatible competitive selection protocols (Q639276) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- On searching a table consistent with division poset (Q868956) (← links)
- Market equilibria with hybrid linear-Leontief utilities (Q1014627) (← links)
- A simplicial approach for discrete fixed point theorems (Q1014795) (← links)
- On the complexity of 2D discrete fixed point problem (Q1035680) (← links)
- The complexity of optimal multidimensional pricing for a unit-demand buyer (Q1651230) (← links)
- A game-theoretic framework for autonomous vehicles velocity control: bridging microscopic differential games and macroscopic mean field games (Q2026592) (← links)
- A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights (Q2323358) (← links)
- How to Compress Interactive Communication (Q2848223) (← links)
- Partial Derivatives in Arithmetic Complexity and Beyond (Q2872492) (← links)
- How to compress interactive communication (Q2875133) (← links)
- (Q2934593) (← links)
- On the Complexity of Nash Equilibria in Anonymous Games (Q2941529) (← links)
- Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries (Q2941544) (← links)
- The complexity of approximating conservative counting CSPs. (Q2957879) (← links)
- Inapproximability after Uniqueness Phase Transition in Two-Spin Systems (Q3167375) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- Settling the complexity of computing two-player Nash equilibria (Q3452212) (← links)
- Computing Exact p-Value for Structured Motif (Q3506919) (← links)
- Quantum Separation of Local Search and Fixed Point Computation (Q3511325) (← links)
- Matching algorithmic bounds for finding a Brouwer fixed point (Q3546370) (← links)
- On algorithms for discrete and approximate brouwer fixed points (Q3581431) (← links)
- On Tractable Exponential Sums (Q3587346) (← links)
- A Simplicial Approach for Discrete Fixed Point Theorems (Q3591330) (← links)
- On Incentive Compatible Competitive Selection Protocol (Q3591339) (← links)
- On the Complexity of 2D Discrete Fixed Point Problem (Q3613784) (← links)
- Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria (Q3652251) (← links)
- Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions (Q4575580) (← links)
- Complexity Dichotomies for Counting Problems (Q4599359) (← links)
- (Q4608026) (← links)
- Settling the Query Complexity of Non-adaptive Junta Testing (Q4625661) (← links)
- Distribution-free Junta Testing (Q4629971) (← links)
- (Q4638112) (← links)
- Complexity of Counting CSP with Complex Weights (Q4640291) (← links)
- The Complexity of Non-Monotone Markets (Q4640292) (← links)
- Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness (Q4977999) (← links)
- Addition is exponentially harder than counting for shallow monotone circuits (Q4978062) (← links)
- Sample-Based High-Dimensional Convexity Testing. (Q5002640) (← links)
- Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces (Q5002641) (← links)
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer (Q5080487) (← links)
- (Q5111156) (← links)
- Smoothed complexity of local max-cut and binary max-CSP (Q5144991) (← links)
- Nearly optimal edge estimation with independent set queries (Q5146974) (← links)
- A Lower Bound on Cycle-Finding in Sparse Digraphs (Q5146975) (← links)
- Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities (Q5171211) (← links)
- Testing unateness nearly optimally (Q5212796) (← links)
