2 citations · 2 across the 2 of their papers we have counts for
4 papers
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…
Toward Minimum Graphic Parity Networks
Yixin Cao, Yiren Lu, Junhong Nie +2
Quantum circuits composed of CNOT and are fundamental building blocks of many quantum algorithms, so optimizing the synthesis of such quantum circuits is crucial. We address…
Forcing a unique minimum spanning tree and a unique shortest path
Tatsuya Gima, Andreas Grigorjew, Yasuaki Kobayashi +7
A forcing set in a combinatorial problem is a set of elements such that there is a unique solution that contains all the elements in . An anti-forcing set is the symmetric c…
QAOA with fewer qubits: a coupling framework to solve larger-scale Max-Cut problem
Yiren Lu, Guojing Tian, Xiaoming Sun
Maximum cut (Max-Cut) problem is one of the most important combinatorial optimization problems because of its various applications in real life, and recently Quantum Approximate Op…