Sharp-P-completeness of 01-permanent

#	Item
1	Twig Patterns: From XML Trees to Graphs ∗ [Extended Abstract] Benny Kimelfeld and Yehoshua Sagiv Add to Reading List Source URL: db.ucsd.edu Language: English - Date: 2007-05-03 17:07:15 Combinatorial optimization Network theory Edsger W. Dijkstra Routing algorithms Spanning tree Shortest path problem Matching Graph database Sharp-P-completeness of 01-permanent Centrality
2	The Complexity of Rationalizing Network Formation Shankar Kalyanaraman Computer Science Department California Institute of Technology Pasadena, CAEmail: Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2009-08-11 16:34:41 Graph coloring Computational problems Combinatorial optimization Matching Graph minor Gap reduction Shortest path problem Sharp-P-completeness of 01-permanent