| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6873774 | Information and Computation | 2018 | 8 Pages |
Abstract
Moreover, we propose a general framework for detecting triangles in graphs and computing Boolean matrix multiplication. Roughly speaking, if we can find the “easy parts” of a given instance efficiently, we can solve the whole problem faster than n3.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Huacheng Yu,