Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Graphs that in a certain precise sense are rich in sets of vertex-disjoint paths are studied. Bounds are obtained on the minimum number of edges in such graphs, and these are used to deduce nonlinear lower bounds on the computational complexity of shifting, merging, and matching problems. © 1976, ACM. All rights reserved.
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995
Hong-linh Truong, Maja Vukovic, et al.
ICDH 2024
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023