doi:j.ipl

First Page		Document Content
Date: 2008-03-02 23:12:13 Automated theorem proving NP-complete problems Unit propagation 2-satisfiability Time complexity Variable MAX-3SAT (SAT ε-UNSAT) Theoretical computer science Mathematics Computational complexity theory		doi:j.ipl Add to Reading List Source URL: www.cc.ntut.edu.tw Download Document from Source Website File Size: 126,13 KB Share Document on Facebook

	Learning to Pass Expectation Propagation Messages Nicolas Heess∗ Gatsby Unit, UCL Daniel Tarlow Microsoft Research DocID: 1xTL0 - View Document
	”Total Monte Carlo” Uncertainty propagation applied to the Phase II-2 burnup calculation (A report for the Assembly Physics of TMI-1 PWR unit cell of the OECD/UAM working group) D. Rochman and C.M. Sciolla DocID: 1uFzW - View Document
	Proc. Asia South Pacific Design Automation Conf. (ASP-DAC), Shanghai, China, vol. 1, Jan. 2005, pp. I/2-I/7. Opportunities and Challenges for Better Than Worst-Case Design Todd Austin, Valeria Bertacco, David Blaauw, an DocID: 1rqwy - View Document
	Microsoft PowerPoint - perspCompatibility Mode] DocID: 1r0cq - View Document