comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ - Time complexity - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-11-26 08:32:22 Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity		comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ Add to Reading List Source URL: www.cs.huji.ac.il Download Document from Source Website File Size: 1,21 MB Share Document on Facebook

	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ DocID: 1rc9S - View Document
	June 2007 Research Brief (PDF) - The Teacher Support Program DocID: xZE4 - View Document
	PDF Document DocID: 1BEy - View Document