activity
20232026
most citedQAOA with fewer qubits: a coupling framework to solve larger-scale Max-Cut problem

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.DS2026

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited

Michael Lampis, Yiren Lu

We revisit the complexity of deciding whether a graphical game admits a pure Nash equilibrium (PNE) parameterized by standard measures of the input graph, such as treewidth. The na…