The following pages link to Pinyan Lu (Q260400):
Displaying 50 items.
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- Erratum to: ``Signature theory in holographic algorithms'' (Q289936) (← links)
- The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
- A computational proof of complexity of some restricted counting problems (Q534558) (← links)
- Holographic algorithms: from art to science (Q619900) (← links)
- Signature theory in holographic algorithms (Q652529) (← links)
- Liquid welfare maximization in auctions with multiple items (Q681843) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- On the theory of matchgate computations (Q841626) (← links)
- On blockwise symmetric signatures for matchgates (Q846363) (← links)
- Basis collapse in holographic algorithms (Q937202) (← links)
- On symmetric signatures in holographic algorithms (Q968267) (← links)
- Holographic algorithms: the power of dimensionality resolved (Q1014633) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
- Relaxing the independence assumption in sequential posted pricing, prophet inequality, and random bipartite matching (Q2152109) (← links)
- An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
- Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
- Bayesian auctions with efficient queries (Q2667811) (← links)
- Improved FPTAS for Multi-spin Systems (Q2851891) (← links)
- (Q2900316) (← links)
- FPTAS for Counting Weighted Edge Covers (Q2921451) (← links)
- Characterization of Truthful Mechanisms for One-Dimensional Single Facility Location Game with Payments (Q2937768) (← links)
- FPTAS for #BIS with Degree Bounds on One Side (Q2941547) (← links)
- The complexity of approximating conservative counting CSPs. (Q2957879) (← links)
- The Complexity of Ferromagnetic Two-spin Systems with External Fields (Q2969666) (← links)
- From Holant to #CSP and Back: Dichotomy for Holant c Problems (Q3060738) (← links)
- Computational Complexity of Holant Problems (Q3096095) (← links)
- (Q3113689) (← links)
- Inapproximability after Uniqueness Phase Transition in Two-Spin Systems (Q3167375) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- (Q3549638) (← links)
- (Q3579392) (← links)
- On Tractable Exponential Sums (Q3587346) (← links)
- On Symmetric Signatures in Holographic Algorithms (Q3590952) (← links)
- Signature Theory in Holographic Algorithms (Q3596750) (← links)
- A Computational Proof of Complexity of Some Restricted Counting Problems (Q3630198) (← links)
- Canonical Paths for MCMC: from Art to Science (Q4575615) (← links)
- An FPTAS for Counting Proper Four-Colorings on Cubic Graphs (Q4575863) (← links)
- FPTAS for Hardcore and Ising Models on Hypergraphs (Q4601903) (← links)
- (Q4608007) (← links)
- (Q4608028) (← links)
- (Q4608057) (← links)
- Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems (Q4636464) (← links)
- (Q4910748) (← links)
- Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- Brief Announcement: Bayesian Auctions with Efficient Queries. (Q5002792) (← links)
