sentence1: finding a maximum weight hypergraph matching is np-hard , even in unweighted 3-uniform hypergraphs .
sentence2: recall that finding a maximum weight hypergraph matching is np-hard even for unweighted , 3-regular hypergraphs .