Graph Matching and Edit Distance Algorithms Publication Trend The graph below shows the total number of publications each year in Graph Matching and Edit Distance Algorithms.

A major advance in computational complexity reveals deep connections between the classes of problems that computers can — and can’t — possibly do.

Most computational complexity researchers assume that this is the case—including Piotr Indyk and Artūrs Bačkurs of MIT, who published the edit-distance finding—but SETH’s validity is still ...