Back to Results
First PageMeta Content



Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Cheeger’s inequality Let G be a d-regular graph with vertex set V = [n]. For a vertex
Add to Reading List

Document Date: 2016-11-17 19:44:26


Open Document

File Size: 122,85 KB

Share Result on Facebook
UPDATE