Potential theory for mean payo games Yury Lifshits* and Dmitri Pavlov Laboratory of Mathematical Logic, Saint Petersburg Department of Steklov Mathematical Institute; and Department of Mathematics, Institute of Fine Mec

First Page		Document Content
Date: 2008-11-06 22:14:54 NP-complete problems Vertex Graph Degeneracy Connected component Connectivity Shortest path problem Tree Routing algorithms Graph theory Mathematics Theoretical computer science		Potential theory for mean payo games Yury Lifshits* and Dmitri Pavlov Laboratory of Mathematical Logic, Saint Petersburg Department of Steklov Mathematical Institute; and Department of Mathematics, Institute of Fine Mec Add to Reading List Source URL: yury.name Download Document from Source Website File Size: 158,98 KB Share Document on Facebook

	Thinking Fast and Slow with Deep Learning and Tree Search Thomas Anthony1, , Zheng Tian1 , and David Barber1,2 arXiv:1705.08439v4 [cs.AI] 3 Dec 2017 DocID: 1xVZc - View Document
	SYNT Workshop - SyGuS Comp’17 SaturdayE3Solver: Decision Tree Unification by Enumeration DocID: 1xVIR - View Document
	Testimonial Green Tree Implements Simple, Impactful Safety Program with WorkSafe Website: greentreehc.com As a home care agency owner I had limited options for workers’ DocID: 1xV42 - View Document
	arXiv:1802.00921v1 [cs.SE] 3 FebA deep tree-based model for software defect prediction Hoa Khanh Dam Trang Pham DocID: 1xV1q - View Document