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

First Page		Document Content
Date: 2016-11-17 19:44:26		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 Source URL: sumofsquares.org Download Document from Source Website File Size: 122,85 KB Share Document on Facebook