The following pages link to Leslie Ann Goldberg (Q242858):
Displaying 50 items.
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
- Approximately counting locally-optimal structures (Q295655) (← links)
- Counting \(4 \times 4\) matrix partitions of graphs (Q313799) (← links)
- The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704) (← links)
- The complexity of weighted and unweighted \(\#\)CSP (Q414939) (← links)
- A counterexample to rapid mixing of the Ge-Stefankovic process (Q428729) (← links)
- The complexity of approximately counting stable roommate assignments (Q440007) (← links)
- The complexity of approximately counting stable matchings (Q441846) (← links)
- Approximating fixation probabilities in the generalized Moran process (Q472467) (← links)
- A complexity dichotomy for hypergraph partition functions (Q626694) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- Approximating the partition function of planar two-state spin systems (Q743131) (← links)
- The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
- Utilitarian resource assignment (Q866544) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
- Markov chain comparison (Q980750) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
- (Q1125453) (redirect page) (← links)
- Approximation algorithms for the fixed-topology phylogenetic number problem (Q1125454) (← links)
- Automating Pólya theory: The computational complexity of the cycle index polynomial (Q1261292) (← links)
- Analysis of practical backoff protocols for contention resolution with multiple servers (Q1305940) (← links)
- Listing graphs that satisfy first-order sentences (Q1337473) (← links)
- The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
- Asymptotically optimal amplifiers for the Moran process (Q1755587) (← links)
- The relative complexity of approximate counting problems (Q1879247) (← links)
- Counting and sampling \(H\)-colourings (Q1887143) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials (Q1936248) (← links)
- Adaptive drift analysis (Q1939672) (← links)
- Ranking games that have competitiveness-based strategies (Q1945930) (← links)
- Uniqueness for the 3-state antiferromagnetic Potts model on the tree (Q1990212) (← links)
- Implementations and the independent set polynomial below the Shearer threshold (Q2098180) (← links)
- The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
- Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- On the computational complexity of weighted voting games (Q2268913) (← links)
- A fixed-parameter perspective on \#BIS (Q2272593) (← links)
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
- Functional clones and expressibility of partition functions (Q2357376) (← links)
- Systematic scan for sampling colorings (Q2494577) (← links)
- Better Approximation Guarantees for Job-Shop Scheduling (Q2706190) (← links)
- An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings (Q2719118) (← links)
- (Q2741175) (← links)
- (Q2753731) (← links)
- (Q2754189) (← links)
- (Q2754194) (← links)
- The Complexity of Gene Placement (Q2775888) (← links)
