'Pt algorithm' presentation slideshows

Testing the independence number of hypergraphs

Testing the independence number of hypergraphs. Michael Langberg. California Institute of Technology. k-uniform hypergraph. I. G=(V,E) Each edge is of size k . I ? IS : no edges included in I . ?(G) = size of max IS. Property testing of ?(G). Input: G=(V,E) .

262 views • 14 slides

Testing the independence number of hypergraphs

Testing the independence number of hypergraphs. Michael Langberg. California Institute of Technology. k-uniform hypergraph. I. G=(V,E) Each edge is of size k . I ? IS : no edges included in I . ?(G) = size of max IS. Property testing of ?(G). Input: G=(V,E) .

145 views • 14 slides

Cell-Projection of Convex Polyhedra

242 views • 10 slides