CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Computational complexity and an integer programming model of Shakashaka Erik D. Demaine∗ Yoshio Okamoto† - Computational complexity of mathematical operations - Document - PDFSEARCH.IO

First Page	Meta Content
	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Computational complexity and an integer programming model of Shakashaka Erik D. Demaine∗ Yoshio Okamoto† Add to Reading List Document Date: 2013-08-11 21:51:59 Open Document File Size: 144,64 KB Share Result on Facebook City Waterloo / / Company 3SAT / CNF / Nikoli / Proposition 3 Let SA / Artificial Intelligence Laboratory / / / Facility The University of Electro-Communications / Osaka Prefecture University / / IndustryTerm candidate solution / feasible solution / distinct solutions / / Organization University of Electro-Communications / Graduate School / School of Information Science / MIT / Osaka Prefecture University / / Person Erik D. Demaine∗ Yoshio Okamoto / Yoshio Okamoto† Ryuhei Uehara / / Position integer programming model / / ProvinceOrState Ontario / / SocialTag Operations research Convex optimization Linear programming Regression analysis NP-complete problems 2-satisfiability Dynamic programming Mathematics Mathematical optimization Theoretical computer science

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Computational complexity and an integer programming model of Shakashaka Erik D. Demaine∗ Yoshio Okamoto†Add to Reading List